Embedding recursive functions in universal algorithms (Q3803097): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Strong noncomputability of random strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5573961 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank | |||
Normal rank | |||
Latest revision as of 18:15, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding recursive functions in universal algorithms |
scientific article |
Statements
Embedding recursive functions in universal algorithms (English)
0 references
1988
0 references
sparse sets
0 references
universal algorithm
0 references
Kolmogorov complexity
0 references
