Statements (49)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:contrastsWith |
Classical probability theory
|
| gptkbp:defines |
A sequence is algorithmically random if it has no shorter description than itself
|
| gptkbp:describes |
Randomness of individual sequences
|
| gptkbp:field |
gptkb:Mathematics
gptkb:Theoretical_computer_science |
| gptkbp:hasApplication |
gptkb:Complexity_theory
Random number generation Cryptography |
| gptkbp:hasSubfield |
gptkb:Kurtz_randomness
gptkb:Schnorr_randomness gptkb:Solovay_randomness Computable randomness Demuth randomness Effective randomness Randomness in algorithmic information theory Randomness in biology Randomness in computable analysis Randomness in computer science Randomness in descriptive set theory Randomness in economics Randomness in engineering Randomness in ergodic theory Randomness in higher recursion theory Randomness in logic Randomness in mathematics Randomness in philosophy Randomness in philosophy of science Randomness in physics Randomness in probability theory Randomness in social sciences Randomness in statistics Randomness with respect to measures Relative randomness Resource-bounded randomness Weak randomness |
| https://www.w3.org/2000/01/rdf-schema#label |
Algorithmic randomness
|
| gptkbp:relatedTo |
gptkb:Kolmogorov_complexity
gptkb:Chaitin's_constant gptkb:Martin-Löf_randomness Random sequence |
| gptkbp:studiedBy |
gptkb:Per_Martin-Löf
gptkb:Andrey_Kolmogorov gptkb:Gregory_Chaitin |
| gptkbp:uses |
gptkb:Computability_theory
Information theory Turing machines |
| gptkbp:bfsParent |
gptkb:The_foundations_of_mathematics
|
| gptkbp:bfsLayer |
7
|