Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Computability
On the continued fraction representation of computable real numbers
Theoretical Computer Science
Complexity theory of real functions
Complexity theory of real functions
Relatively recursive reals and real functions
Theoretical Computer Science - Special issue on real numbers and computers
From axiomatics to intrinsic characterization: some open problems in computable analysis
Theoretical Computer Science - Special issue on computability and complexity in analysis
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
Recursively Enumerable Reals and Chaitin Omega Numbers
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Randomness, Computability, and Density
STACS '01 Proceedings of the 18th 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
Journal of Computer and System Sciences
Totally ω computably enumerable and m-topped degrees
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Presentations of K-trivial reals and kolmogorov complexity
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
| Hi-index | 5.23 |
We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefix-free set of binary strings.