Program size complexity for possibly infinite computations
From MaRDI portal
Publication:558440
DOI10.1305/ndjfl/1107220673zbMath1102.68036OpenAlexW2021017634WikidataQ61927042 ScholiaQ61927042MaRDI QIDQ558440
Verónica Becher, Silvana Picchi, Santiago Figueira, André Nies
Publication date: 6 July 2005
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1107220673
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets ⋮ Randomness and universal machines ⋮ Random numbers as probabilities of machine behavior ⋮ Degrees of monotone complexity ⋮ Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Information-theoretic characterizations of recursive infinite strings
- Algorithmic entropy of sets
- Process complexity and effective random tests
- A Theory of Program Size Formally Identical to Information Theory
- Relations between varieties of kolmogorov complexities
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The definition of random sequences
This page was built for publication: Program size complexity for possibly infinite computations
