On the phenomenon of autocomputability

Electronic Notes in Theoretical Computer Science

Volumn 31, Issue , 2000, Pages 2-15

  Arslanov, Asat ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

AUTOCOMPUTABILITY; COMPUTABLY ENUMERABLE; NATURAL NUMBERS; RECURSION THEORY;

COMPUTABILITY AND DECIDABILITY;

EID: 18944391692     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80326-3     Document Type: Article

References (11)

1. Calude C.S. "Information and Randomness. An Algorithmic Perspective," 1994;Springer-Verlag, Berlin
2. Chaitin G.J. "Algorithmic Information Theory," 1990;Cambridge University Press, Cambridge, 1987 (third printing
3. Kautz S. "Degrees of Random Sets," PhD Thesis, Cornell University. 1991
4. Li M., Vitányi P.M. "An Introduction to Kolmogorov Complexity and Its Applications," 1993;Springer-Verlag, Berlin
5. Nabutovsky Alex, Weinberger Shmuel. The Fractal Nature of Riem/Diff. Draft: Work in progress. 1999;30
6. Odifreddi P. "Classical Recursion Theory," North-Holland, Amsterdam. 1989
7. Post E.L. Recursively enumerable sets of positive integers and their decision problems. Bull. Amer. Math. Soc. 50:1944;284-316
8. H. Rogers, Jr. "Theory of Recursive Functions and Effective Computability," McGraw-Hill, New York, 1967.
9. Soare R.I. "Recursively Enumerable Sets and Degrees," 1987;Springer-Verlag, Berlin
10. R.I. Soare, URL: http://www.cs.uchicago.edu/~soare/lectures/examples. text.
11. Trakhtenbrot B.A. On autoreducibility. Dokl. Akad. Nauk. 192:1970;1224-1227