Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Algorithms and Complexity in Mathematics, Epistemology, and Science -

Algorithms and Complexity in Mathematics, Epistemology, and Science

Proceedings of 2015 and 2016 ACMES Conferences
Buch | Hardcover
294 Seiten
2019 | 1st ed. 2019
Springer-Verlag New York Inc.
978-1-4939-9050-4 (ISBN)
CHF 149,75 inkl. MwSt
  • Versand in 10-15 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
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. 

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).

Erscheinungsdatum
Reihe/Serie Fields Institute Communications ; 82
Zusatzinfo 28 Illustrations, color; 25 Illustrations, black and white; XI, 294 p. 53 illus., 28 illus. in color.
Verlagsort New York
Sprache englisch
Maße 155 x 235 mm
Themenwelt Geisteswissenschaften Philosophie Erkenntnistheorie / Wissenschaftstheorie
Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Analysis
Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Schlagworte computation and complexity theory • Computer Algebra • Error Analysis • perturbation theory • reliability and uncertainty quantification • Scientific Computing
ISBN-10 1-4939-9050-0 / 1493990500
ISBN-13 978-1-4939-9050-4 / 9781493990504
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich