Publication | Open Access
Algorithmic information theory
59
Citations
15
References
1989
Year
Artificial IntelligenceEngineeringInformation TheoryIncompletenessEntropyAutomated ReasoningProof ComplexityCritical DiscussionFirst Incompleteness TheoremComputational ComplexityProbability TheoryComputer ScienceAlgorithmic Information TheoryKolmogorov ComplexityComputability Theory
Abstract We present a critical discussion of the claim (most forcefully propounded by Chaitin) that algorithmic information theory sheds new light on Gödel's first incompleteness theorem.
| Year | Citations | |
|---|---|---|
Page 1
Page 1