Prefix-free languages and initial segments of computably enumerable degrees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2108, Issue , 2001, Pages 576-585

  Wu, Guohua ^a  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

COMPUTABLE PRESENTATIONS; COMPUTABLY ENUMERABLE; PREFIX-FREE;

COMPUTABILITY AND DECIDABILITY;

EID: 26444562268     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_64     Document Type: Conference Paper

References (11)

1. C. Calude, Information Theory and Randomness, An Algorithmic Perspective, Springer-Verlag, Berlin, 1994.
2. C. Calude, P. Hertling, B. Khoussainov, Y. Wang, Recursively enumerable reals and Chaitin’s Ω number, in STACS’98, Springer Lecture Notes in Computer Science, Vol. 1373 (1988), 596-606.
3. G. J. Chaitin, Algorithmic Information Theory, Cambridge University Press, Cambridge, 1987. (Third Print, 1990).
4. R. Downey, D. Hirschfeldt, A. Nies, Randomness, computability, and density, to appear.
5. R. Downey, G. LaForte, Presentations of computably enumerable reals, Theoretical Computer Science, to appear.
6. A. Kučera, T. Slaman, Randomness and recursive enumerability, SIAM Journal on Computing, to appear.
7. M. Li, P. Vitanyi, Kolmogorov Complexity and Its Applications, Springer-Verlag, New York, Berlin, Heidelberg, 1993.
8. R. I. Soare, Recursion theory and Dedekind cuts, Transactions of American Mathematical Society 140(1969), 271-294.
9. R. I. Soare, Recursively Enumerable Sets and Degrees, Springer-Verlag, Berlin, 1987.
10. E. Spector, Nicht konstrucktive beweisbare satze der analysics, Journal of Symbolic Logic 14 (1949), 145-158.
11. A. M. Turing, On computable numbers with an application to the Entscheidungsproblem, Proceedings of American Mathematical Society 42 (1936-1937), 230-265 2000; a correction, Proceedings of American Mathematical Society. 43 (1937), 544-546.