Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Omega
|
| gptkbp:definedIn |
gptkb:Gregory_Chaitin
|
| gptkbp:describes |
halting probability of a universal Turing machine
|
| gptkbp:field |
algorithmic information theory
|
| gptkbp:hasNo |
finite algorithm to compute its digits
|
| gptkbp:hasProperty |
every bit is maximally unknowable
|
| gptkbp:heldBy |
different values for different universal Turing machines
algorithmically random between 0 and 1 computably enumerable non-computable normal number (conjectured) real number uncomputable real number |
| https://www.w3.org/2000/01/rdf-schema#label |
Chaitin's constant
|
| gptkbp:introducedIn |
1975
|
| gptkbp:relatedTo |
Technical Machine
halting problem |
| gptkbp:symbol |
Ω
|
| gptkbp:usedIn |
incompleteness proofs
|
| gptkbp:bfsParent |
gptkb:Kolmogorov_complexity
|
| gptkbp:bfsLayer |
5
|