The unknowable
computability theoryhalting problemincompleteness theoreminformation theorylimits of epistemology and logicLISPmathematics in the Third Millenniumrandomnessunsolvability
Philosophy of mathematics (00A30) History of mathematics in the 21st century (01A61) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10) Information theory (general) (94A15)
Here's a close look at the limits of epistemology and logic. Of course, Goethe made many deeper and broader remarks on limitations of Reason (represented by Mephistopheles) in his dramatic work, Faust. The author brings together information theory and computability theory in the context of randomness. For example, some unprovable formal statements (say even in mathematics) are true for no reason; they are true by accident or randomness! Unlike physics (perhaps), there can be no ``theory of everything in mathematics or formal logic. The author makes good use of the artificial intelligence programming language, LISP; e.g., a LISP run to illustrate Gödel's proof of his first incompleteness theorem. Among the interesting topics presented are: Gödel's proof of his incompleteness theorem, Turing's proof of the unsolvability of the halting problem, a proof that one cannot show that a LISP expression is elegant, and mathematics in the Third Millennium. The ideas presented here are sufficiently simple that it is surprising to me that Erdős, Gödel or Shannon didn't come up with them earlier!
- Maschinen, Intelligenz und Selbstbezüglichkeit - Gedanken zu einem Bestseller
- Are we finite?
- Chaitin numbers, Solovay machines, and Gödel incompleteness.
- Boundary element color interpolation for instrumentation, imaging and internet graphics industries
- Entropic measures, Markov information sources and complexity
- Information theory, evolution and the origin of life
- Process physics: Inertia, gravity and the quantum
- Randomness on full shift spaces
- Revisiting Chaitin's incompleteness theorem
- Algorithmic complexity as a criterion of unsolvability
- Biological function and the genetic code are interdependent
- The outer limits of reason. What science, mathematics, and logic cannot tell us
- An incompleteness theorem for the natural world
- On the diagonal lemma of Gödel and Carnap
- Undescribable Events
- Developments in Parrondo’s Paradox
- Descriptions and unknowability
- scientific article; zbMATH DE number 2107358 (Why is no real title available?)
- Chaitin and civilization 2.0
- Some modern perspectives on the quest for ultimate knowledge
- Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable
- From Heisenberg to Gödel via Chaitin
- From Heisenberg to Gödel via Chaitin
- Nonlinear dynamics and the two-slit delayed experiment
- A characterization of c. e. random reals
- The ineffability of God – a logical approach
- On randomization and discovery
This page was built for publication: The unknowable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4259438)
