scientific article; zbMATH DE number 1163978

zbMATH Open0915.03012MaRDI QIDQ4395604

Gregory J. Chaitin

Publication date: 4 August 1998

Title of this publication is not available (Why is that?)

zbMATH Keywords

algorithmic information theoryKolmogorov complexityfoundations of mathematicsGödel's incompleteness theorem

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations of classical theories (including reverse mathematics) (03B30) Turing machines and related notions (03D10)

Related Items (3)

Title not available (Why is that?) ⋮ Randomization and eventual reordering: a number theoretic approach ⋮ Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Algorithmic randomness, reverse mathematics, and the dominated convergence theorem 👍 👎
• Information, randomness and incompleteness. Papers on algorithmic information theory 👍 👎
• Randomness, Computation and Mathematics 👍 👎
• Algorithmic Information Theory and Foundations of Probability 👍 👎
• Randomness conservation inequalities; information and independence in mathematical theories 👍 👎
• RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS 👍 👎
• Computable Measure Theory and Algorithmic Randomness 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4395604)