Abstract Chaitin's theorem and its methodological consequences

MaRDI QIDQ2856057zbMATH OpenFDO

Authors Nikolay N. Nepeivoda

Publication date 23 October 2013

zbMATH Keywords

Chaitin's theoremGödel's theoremKant's antinomyKolmogorov complexityParkinson's law

Mathematics Subject Classification ID

Logic in the philosophy of science (03A10) Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Algorithmic information theory
• scientific article; zbMATH DE number 5187689
• On the Kolmogorov-Chaitin Complexity for short sequences
• scientific article; zbMATH DE number 6845503
• scientific article; zbMATH DE number 2040936

Cited in

(1)

• Chaitin and civilization 2.0

This page was built for publication: Abstract Chaitin's theorem and its methodological consequences

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