Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
algorithmic randomness
|
| gptkbp:characterizedBy |
incompressibility
lack of shorter description |
| gptkbp:contrastsWith |
computable sequences
|
| gptkbp:describes |
randomness of infinite binary sequences
|
| gptkbp:formedBy |
prefix-free Turing machines
|
| https://www.w3.org/2000/01/rdf-schema#label |
Chaitin randomness
|
| gptkbp:implies |
no algorithm can compress the sequence
sequence passes all effective statistical tests for randomness |
| gptkbp:introducedIn |
1970s
|
| gptkbp:namedAfter |
gptkb:Gregory_Chaitin
|
| gptkbp:relatedTo |
gptkb:Kolmogorov_complexity
algorithmic information theory |
| gptkbp:usedIn |
gptkb:information_theory
gptkb:logic theoretical computer science |
| gptkbp:bfsParent |
gptkb:Martin-Löf_randomness
|
| gptkbp:bfsLayer |
6
|