Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Algorithms and Complexity in Mathematics, Epistemology, and Science
Details
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.
By bringing together contributions from researchers who approach the mathematical sciences from different perspectives, the volume will further readers' understanding of the multifaceted role of mathematics in modern science, informed by the state of the art in mathematics, scientific computing, and current modeling techniques.
Features important perspectives on computational discovery and computational epistemology, and presents them in an accessible way Contains state of the art discussions by experts on a broad collection of topics that includes pure and applied mathematics, computer science, and philosophy of science Offers new and useful ways to contextualize the issues of reliability and reproducible of computation Contributes to building a network of scholars from varied backgrounds with interests in the multifaceted field of computational mathematics and epistemology
Inhalt
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).
Weitere Informationen
- Allgemeine Informationen
- GTIN 09781493990504
- Editor Nicolas Fillion, Ilias S. Kotsireas, Robert M. Corless
- Sprache Englisch
- Auflage 1st edition 2019
- Größe H241mm x B160mm x T23mm
- Jahr 2019
- EAN 9781493990504
- Format Fester Einband
- ISBN 1493990500
- Veröffentlichung 08.02.2019
- Titel Algorithms and Complexity in Mathematics, Epistemology, and Science
- Untertitel Proceedings of 2015 and 2016 ACMES Conferences
- Gewicht 629g
- Herausgeber Springer New York
- Anzahl Seiten 308
- Lesemotiv Verstehen
- Genre Mathematik