Algorithms and Complexity in Mathematics, Epistemology, and Science, 1st ed. 2019 Proceedings of 2015 and 2016 ACMES Conferences Fields Institute Communications Series, Vol. 82

ACMES (Algorithms and Complexity in Mathematics, Epistemology, and Science) is a multidisciplinary conference series that focuses on epistemological and mathematical issues relating to computation in modern science. This volume includes a selection of papers presented at the 2015 and 2016 conferences held at Western University that provide an interdisciplinary outlook on modern applied mathematics that draws from theory and practice, and situates it in proper context. These papers come from leading mathematicians, computational scientists, and philosophers of science, and cover a broad collection of mathematical and philosophical topics, including numerical analysis and its underlying philosophy, computer algebra, reliability and uncertainty quantification, computation and complexity theory, combinatorics, error analysis, perturbation theory, experimental mathematics, scientific epistemology, and foundations of mathematics. 

Introduction.- Ethics and the Continuum Hypothesis (J.R. Brown).- How to Generate All Possible Rational Wilf-Zeilberger Pairs (S. Chen).- Backward Error Analysis for Perturbation Methods (R.M. Corless, N. Fillion).- Proof Verification Technology and Elementary Physics (E. Davis).- An Applied/Computational Mathematician's View of Uncertainty Quantification for Complex Systems (M. Gunzburger).- Dynamical Symmetries and Model Validation (B.C. Jantzen).- Modeling the Biases in Last Digit Distributions of Consecutive Primes (D. Lichtblau).- Computational Aspects of Hamburger's Theorem (Y. Matiyasevich).- Effective Validity: A Generalized Logic for Stable Approximate Inference (R.H.C. Moir).- Counterfactuals in the Real World (J. Woodward, M. Wilson).