The limits of mathematics
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1542872
- The limits of mathematics. A course on information theory and the limits of formal reasoning. With a foreword by Cristian Calude
- Information, randomness and incompleteness. Papers on algorithmic information theory
- The halting probability Omega: irreducible complexity in pure mathematics
- scientific article; zbMATH DE number 6845503
Cited in
(21)- A comparison of two approaches to pseudorandomness
- Chaitin numbers, Solovay machines, and Gödel incompleteness.
- Entropic measures, Markov information sources and complexity
- Information theory, evolution and the origin of life
- Is complexity a source of incompleteness?
- On explicating the concept `the power of an arithmetical theory'
- Analog computation beyond the Turing limit
- Metamathematical limits to computation
- scientific article; zbMATH DE number 1820020 (Why is no real title available?)
- From mathesis universalis to provability, computability, and constructivity
- EXACT APPROXIMATIONS OF OMEGA NUMBERS
- Formal Proof: Reconciling Correctness and Understanding
- scientific article; zbMATH DE number 1542872 (Why is no real title available?)
- scientific article; zbMATH DE number 1875872 (Why is no real title available?)
- Comprehending software correctness implies comprehending an intelligence-related limitation
- Forbidden information
- Computing a Glimpse of Randomness
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- A characterization of c. e. random reals
- The halting probability Omega: irreducible complexity in pure mathematics
- A new version of algorithmic information theory.
This page was built for publication: The limits of mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4942040)
