Related papers: Meta Math! The Quest for Omega
This book examines a number of problems of quantum mechanics, most of which are not usually discussed. What is the origin of probabilities in the mechanics of the microworld? What is the nature of Planck's constant h? What is the nature of…
Mathematical oncology is an interdisciplinary research field where the mathematical sciences meet cancer research. Being situated at the intersection of these two fields makes mathematical oncology highly dynamic, as practicing researchers…
The last century saw dramatic challenges to the Laplacian predictability which had underpinned scientific research for around 300 years. Basic to this was Alan Turing's 1936 discovery (along with Alonzo Church) of the existence of…
Recent advances in computing have changed not only the nature of mathematical computation, but mathematical proof and inquiry itself. While artificial intelligence and formalized mathematics have been the major topics of this conversation,…
Noting that lemmas are a key feature of mathematics, we engage in an investigation of the role of lemmas in automated theorem proving. The paper describes experiments with a combined system involving learning technology that generates…
This survey article on Hilbert's first and second problems is adapted from a one-hour colloquium lecture given at the University of Auckland in May, 2000, just three months before the 100th anniversary of Hilbert's lecture. It includes an…
Modern mathematics is known for its rigorous proofs and tight analysis. Math is the paradigm of objectivity for most. We identify the source of that objectivity as our knowledge of the physical world given through our senses. We show in…
This is neither an elementary introduction to singularity theory nor a specialized treatise containing many new theorems. The purpose of this little book is to invite the reader on a mathematical promenade. We pay a visit to Hipparchus,…
The mathematical achievements of Harry Kesten since the mid-1950s have revolutionized probability theory as a subject in its own right and in its associations with aspects of algebra, analysis, geometry, and statistical physics. Through his…
Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic $L$ can be solved efficiently on every class $\mathscr{C}$ of structures…
The multi-layered nature of societal developments poses a challenge in the teaching and learning of history of mathematics. As an attempt to tackle this challenge we experimented with the use of Knowledge-Maps. The focus of our interest…
In 1975, Chaitin introduced his celebrated Omega number, the halting probability of a universal Chaitin machine, a universal Turing machine with a prefix-free domain. The Omega number's bits are {\em algorithmically random}--there is no…
Optimal transport has been one of the most exciting subjects in mathematics, starting from the 18th century. As a powerful tool to transport between two probability measures, optimal transport methods have been reinvigorated nowadays in a…
This work is an attempt to 'reconstruct' logarithms in the hypothetical case that mankind has suffered a catastrophe through which all repositories of (mathematical as well as other) knowledge are lost, with the exception of simple…
What is the role of the constants of nature in physical theory? I hypothesize that the observable universe, u0, constitutes a Universal Turing Machine (UTM) constrained by algorithmically random logical tape parameters defining its material…
This paper collects some reflections about an apparent incongruity between the usual (third-person) understanding of the probability of an event calculated for an extended period of time in the future (e.g., the expected probability of a…
After the development of a self-consistent quantum formalism nearly a century ago, there ensued a quest to understand the often counterintuitive predictions of the theory. These endeavors invariably begin with the assumption of the "truth"…
Computational philosophy is the use of mechanized computational techniques to unearth philosophical insights that are either difficult or impossible to find using traditional philosophical methods. Computational metaphysics is computational…
In this expository article, we describe the recent approach, motivated by ergodic theory, towards detecting arithmetic patterns in the primes, and in particular establishing that the primes contain arbitrarily long arithmetic progressions.…
The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs.