Chaitin's incompleteness theorem
GPTKB entity
Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
gptkb:logic
algorithmic information theory |
| gptkbp:formedBy |
gptkb:Gregory_Chaitin
|
| gptkbp:hasConcept |
gptkb:Kolmogorov_complexity
algorithmic randomness |
| https://www.w3.org/2000/01/rdf-schema#label |
Chaitin's incompleteness theorem
|
| gptkbp:implies |
limits of formal axiomatic systems
|
| gptkbp:influenced |
gptkb:logic
algorithmic information theory |
| gptkbp:influencedBy |
gptkb:Gödel_numbering
gptkb:Turing's_halting_problem |
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:Gödel's_incompleteness_theorems
|
| gptkbp:state |
There exist true mathematical statements that cannot be proven within a given formal system due to their algorithmic randomness.
|
| gptkbp:yearProposed |
1970s
|
| gptkbp:bfsParent |
gptkb:Gregory_Chaitin
|
| gptkbp:bfsLayer |
6
|