Algorithms and Complexity in Mathematics, Epistemology, and Science - Fields Institute Communications
Latest Publications

TOTAL DOCUMENTS

10

(FIVE YEARS 10)

H-INDEX

1

(FIVE YEARS 1)

Published By Springer New York

9781493990504, 9781493990511

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Proof Verification Technology and Elementary Physics

Algorithms and Complexity in Mathematics, Epistemology, and Science - Fields Institute Communications ◽

10.1007/978-1-4939-9051-1_4 ◽

2019 ◽

pp. 81-132

Author(s):

Ernest Davis

Keyword(s):

Proof Verification

Download Full-text

Backward Error Analysis for Perturbation Methods

Algorithms and Complexity in Mathematics, Epistemology, and Science - Fields Institute Communications ◽

10.1007/978-1-4939-9051-1_3 ◽

2019 ◽

pp. 35-79

Author(s):

Robert M. Corless ◽

Nicolas Fillion

Keyword(s):

Error Analysis ◽

Perturbation Methods ◽

Backward Error Analysis ◽

Download Full-text

Counterfactuals in the Real World

Algorithms and Complexity in Mathematics, Epistemology, and Science - Fields Institute Communications ◽

10.1007/978-1-4939-9051-1_10 ◽

2019 ◽

pp. 269-294

Author(s):

James Woodward ◽

Mark Wilson

Keyword(s):

Download Full-text

Modeling the Biases in Last Digit Distributions of Consecutive Primes

Algorithms and Complexity in Mathematics, Epistemology, and Science - Fields Institute Communications ◽

10.1007/978-1-4939-9051-1_7 ◽

2019 ◽

pp. 177-193

Author(s):

Daniel Lichtblau

Download Full-text

Ethics and the Continuum Hypothesis

Algorithms and Complexity in Mathematics, Epistemology, and Science - Fields Institute Communications ◽

10.1007/978-1-4939-9051-1_1 ◽

2019 ◽

pp. 1-16

Author(s):

James Robert Brown

Keyword(s):

Continuum Hypothesis ◽

Download Full-text

Effective Validity: A Generalized Logic for Stable Approximate Inference

Algorithms and Complexity in Mathematics, Epistemology, and Science - Fields Institute Communications ◽

10.1007/978-1-4939-9051-1_9 ◽

2019 ◽

pp. 225-268

Author(s):

Robert H. C. Moir

Keyword(s):

Approximate Inference

Download Full-text

How to Generate All Possible Rational Wilf-Zeilberger Pairs?

Algorithms and Complexity in Mathematics, Epistemology, and Science - Fields Institute Communications ◽

10.1007/978-1-4939-9051-1_2 ◽

2019 ◽

pp. 17-34 ◽

Author(s):

Shaoshi Chen

Download Full-text

Dynamical Symmetries and Model Validation

Algorithms and Complexity in Mathematics, Epistemology, and Science - Fields Institute Communications ◽

10.1007/978-1-4939-9051-1_6 ◽

2019 ◽

pp. 153-176

Author(s):

Benjamin C. Jantzen

Keyword(s):

Model Validation ◽

Dynamical Symmetries

Download Full-text

An Applied/Computational Mathematician’s View of Uncertainty Quantification for Complex Systems

Algorithms and Complexity in Mathematics, Epistemology, and Science - Fields Institute Communications ◽

10.1007/978-1-4939-9051-1_5 ◽

2019 ◽

pp. 133-151

Author(s):

Max Gunzburger

Keyword(s):

Complex Systems ◽

Uncertainty Quantification

Download Full-text

Computational Aspects of Hamburger’s Theorem

Algorithms and Complexity in Mathematics, Epistemology, and Science - Fields Institute Communications ◽

10.1007/978-1-4939-9051-1_8 ◽

2019 ◽

pp. 195-223 ◽

Author(s):

Yuri Matiyasevich

Keyword(s):

Computational Aspects

Download Full-text