On universal computably enumerable prefix codes
From MaRDI portal
Publication:3616215
DOI10.1017/S0960129508007238zbMath1156.94327OpenAlexW2031395815WikidataQ57001588 ScholiaQ57001588MaRDI QIDQ3616215
Ludwig Staiger, Cristian S. Calude
Publication date: 24 March 2009
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129508007238
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Prefix, length-variable, comma-free codes (94A45)
Related Items
Simplicity via provability for universal prefix-free Turing machines ⋮ Universal Recursively Enumerable Sets of Strings ⋮ Universal recursively enumerable sets of strings ⋮ Zipf's law and L. Levin probability distributions ⋮ Non-regular Maximal Prefix-Free Subsets of Regular Languages ⋮ SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS
Cites Work
- Unnamed Item
- Natural halting probabilities, partial randomness, and zeta functions
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- Kolmogorov complexity and Hausdorff dimension
- Algorithmic Randomness and Complexity
- Algorithmic Information Theory
- Computability and Randomness
- On the entropy of context-free languages
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
