On elementary computability-theoretic properties of algorithmic randomness (Q2703742)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On elementary computability-theoretic properties of algorithmic randomness |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On elementary computability-theoretic properties of algorithmic randomness |
scientific article |
Statements
8 May 2001
0 references
Chaitin's randomness
0 references
self-delimiting complexity measure
0 references
\(K\)-bounded sequences
0 references
On elementary computability-theoretic properties of algorithmic randomness (English)
0 references
