Information-theoretic incompleteness (Q1200218)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 96914
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Information-theoretic incompleteness |
scientific article; zbMATH DE number 96914 |
Statements
Information-theoretic incompleteness (English)
0 references
17 January 1993
0 references
In this interesting note the author continues his many investigations of the incompleteness of basic topological systems. Several fundamental incompleteness theorems in his book on algorithmic information theory [Algorithmic information theory (1987; Zbl 0655.68003)] are reformulated based upon an improved definition of the complexity of a formal axiomatic system. The value added comes from measuring the complexity of a formal system in terms of the program-size complexity of enumerating its infinite set of theorems rather than in terms of the program-size complexity of the finite strings of axioms. Included is an incompleteness theorem for diophantine equations.
0 references
algorithmic entropy
0 references
randomness
0 references
complexity of a formal axiomatic system
0 references
incompleteness theorem for diophantine equations
0 references
0 references
0.7834254503250122
0 references
0.7833256721496582
0 references
0.7704341411590576
0 references
