Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness (Q2249007)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness |
scientific article |
Statements
Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness (English)
0 references
27 June 2014
0 references
algorithmic probability
0 references
algorithmic complexity
0 references
program-size complexity
0 references
halting probability
0 references
Chaitin's \({\Omega}\)
0 references
Levin's universal distribution
0 references
Levin-Chaitin coding theorem
0 references
busy beaver problem
0 references
Kolmogorov-Chaitin complexity
0 references
0 references
