scientific article; zbMATH DE number 1327755

zbMath0928.03001MaRDI QIDQ4259438

Gregory J. Chaitin

Publication date: 25 August 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

information theorycomputability theoryhalting problemrandomnessunsolvabilityLISPincompleteness theoremlimits of epistemology and logicmathematics in the Third Millennium

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Philosophical and critical aspects of logic and foundations (03A05) 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) Information theory (general) (94A15) Turing machines and related notions (03D10)

Related Items (17)

Boundary element color interpolation for instrumentation, imaging and internet graphics industries ⋮ Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable ⋮ Algorithmic complexity as a criterion of unsolvability ⋮ An Incompleteness Theorem for the Natural World ⋮ Revisiting Chaitin's incompleteness theorem ⋮ Nonlinear dynamics and the two-slit delayed experiment ⋮ Biological function and the genetic code are interdependent ⋮ A characterization of c. e. random reals ⋮ Developments in Parrondo’s Paradox ⋮ ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP ⋮ From Heisenberg to Gödel via Chaitin ⋮ From Heisenberg to Gödel via Chaitin ⋮ Entropic measures, Markov information sources and complexity ⋮ Information theory, evolution and the origin of life ⋮ Process physics: Inertia, gravity and the quantum ⋮ Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness. ⋮ Randomness on full shift spaces

This page was built for publication: