Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Information randomness & incompleteness: papers on algorithmic information theory (2nd ed.)
Information randomness & incompleteness: papers on algorithmic information theory (2nd ed.)
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
Presentations of computably enumerable reals
Theoretical Computer Science
Recursively Enumerable Reals and Chaitin Omega Numbers
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Prefix-Free Languages and Initial Segments of Computably Enumerable Degrees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
Initial segment complexities of randomness notions
Information and Computation
| Hi-index | 0.00 |
For given real α ∈ {0,1}∞, a presentation V of α is a prefix-free and recursively enumerable subset of {0,1}* such that $\alpha = \Sigma_{\sigma\epsilon\nu}2^{-|\sigma|}$. So, α has a presentation iff α is a left-r.e. real.