Algorithmic information theory
Algorithmic information theory
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
Kolmogorov complexity and Hausdorff dimension
Information and Computation
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
Theory of Codes
Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
Natural halting probabilities, partial randomness, and zeta functions
Information and Computation
Computability and Randomness
Universal Recursively Enumerable Sets of Strings
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Simplicity via provability for universal prefix-free Turing machines
Theoretical Computer Science
| Hi-index | 0.01 |
We study computably enumerable (c.e.) prefix codes that are capable of coding all positive integers in an optimal way up to a fixed constant: these codes will be called universal. We prove various characterisations of these codes, including the following one: a c.e. prefix code is universal if and only if it contains the domain of a universal self-delimiting Turing machine. Finally, we study various properties of these codes from the points of view of computability, maximality and density.