Noisy Deductive Reasoning: How Humans Construct Math, and How Math Constructs Universes

We present a computational model of mathematical reasoning according to which mathematics is a fundamentally stochastic process. That is, on our model, whether or not a given formula is deemed a theorem in some axiomatic system is not a matter of certainty, but is instead governed by a probability distribution. We then show that this framework gives a compelling account of several aspects of mathematical practice. These include: 1) the way in which mathematicians generate research programs, 2) the applicability of Bayesian models of mathematical heuristics, 3) the role of abductive reasoning in mathematics, 4) the way in which multiple proofs of a proposition can strengthen our degree of belief in that proposition, and 5) the nature of the hypothesis that there are multiple formal systems that are isomorphic to physically possible universes. Thus, by embracing a model of mathematics as not perfectly predictable, we generate a new and fruitful perspective on the epistemology and practice of mathematics.

[1]  C. Peirce,et al.  Collected Papers of Charles Sanders Peirce , 1936, Nature.

[2]  Mark Alford,et al.  On Math, Matter and Mind , 2005, physics/0510188.

[3]  Paul M. B. Vitányi,et al.  Shannon Information and Kolmogorov Complexity , 2004, ArXiv.

[4]  Kurt Gödel,et al.  On undecidable propositions of formal mathematical systems , 1934 .

[5]  J. Urgen Schmidhuber.  A Computer Scientist's View of Life, the Universe, and Everything , 1997 .

[6]  Max Tegmark.  Is “the Theory of Everything” Merely the Ultimate Ensemble Theory?☆ , 1997, gr-qc/9704009.

[7]  Burr Settles,et al.  Active Learning Literature Survey , 2009 .

[8]  C. Hartshorne,et al.  Collected Papers of Charles Sanders Peirce , 1935, Nature.

[9]  David H. Wolpert,et al.  The stochastic thermodynamics of computation , 2019, Journal of Physics A: Mathematical and Theoretical.

[10]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[11]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[12]  Simon DeDeo,et al.  Explosive Proofs of Mathematical Truths , 2020, ArXiv.

[13]  Max Tegmark.  The Mathematical Universe , 2007, Foundations of Physics.

[14]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[15]  Scott Aaronson,et al.  Why Philosophers Should Care About Computational Complexity , 2011, Electron. Colloquium Comput. Complex..

[16]  D. Hilbert.  Die grundlagen der mathematik , 1928 .

[18]  James L. Carroll,et al.  A bayesian decision theoretical approach to supervised learning, selective sampling, and empirical function optimization , 2010 .

[19]  E. Wigner.  The Unreasonable Effectiveness of Mathematics in the Natural Sciences (reprint) , 1960 .

[20]  David Hume.  A Treatise of Human Nature: Being an Attempt to introduce the experimental Method of Reasoning into Moral Subjects , 1972 .

[21]  Max Tegmark.  Our Mathematical Universe: My Quest for the Ultimate Nature of Reality , 2014 .

[22]  David H. Wolpert,et al.  The Lack of A Priori Distinctions Between Learning Algorithms , 1996, Neural Computation.

[23]  Max Tegmark.  The Multiverse Hierarchy , 2009, 0905.1283.

[24]  John D. Barrow,et al.  Theories of Everything , 1991 .