There is no SW-complete C.E. real

Journal of Symbolic Logic

Volumn 69, Issue 4, 2004, Pages 1163-1170

  Liang, Yu ^a   Decheng, Ding ^a  

^a NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 11844253835     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1102022216     Document Type: Article

References (14)

1. CHRISTIAN S. CALUDE, PETER HERTLING, BAKHADYR KHOUSSAINOV, and YONGGE WANG, Recursively enumerable reals and Chaitin's Ω number, Stacs '98 (M. Morvan. C. Meinel. and D. Krob. editors). Lecture Notes in Computer Science, vol. 1373. Springer, 1998. pp. 596-606.
2. GREGORY J. CHAITIN. A theory of program size formally identical to information theory. Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 547-569.
3. _. Algorithmic information theory, Cambridge University Press. Cambridge. 1987.
4. _, Incompleteness theorems for random reals. Advances in Applied Mathematics, vol. 8 (1987). pp. 119-146.
5. RODNEY G. DOWNEY and DENIS R. HIRSCHFELDT. Algorithmic randomness and complexity. Monographs in Computer Science, Springer-Verlag.
6. RODNEY G. DOWNEY. DENIS R. HIRSCHFELDT, and GEOFF LAFORTE. Randomness and reducibility, Journal of Computer and System Sciences, vol. 68 (2004). pp. 96-114.
7. A. N. KOLMOGOROV. Three approaches to the quantitative definition of information. Problems of Information Transmission (Proolemy Peredachi Informaisii), vol. 1 (1965). pp. 1-7.
8. ANTONIN KUČBRA and THEODORE A. SLAMAN. Randomness and recursive enumerability. SIAM Journal on Computing, vol. 31 (2001). pp. 199-211.
9. MING LI and PAUL VITÁNYI. An introduction to Kolmogorov complexity and its applications, second ed., Graduate Texts in Computer Science. Springer-Verlag, New York, 1997.
10. P. MARTIN-LÖF. The definition of random sequences. Information and Control, vol. 9 (1966). pp. 602-619.
11. C. P. SCHNORR. Zufälligkeit und Wahrscheinlichkeit. Lecture Notes in Mathematics, vol. 218, Springer-Verlag, New York, 1971.
12. ROBERT I. SOARE. Recursion theory and Dedekind cuts. Transactions of the American Mathematical Society, vol. 140 (1969). pp. 271-294.
13. _. Recursively enumerable sets and degrees, Springer-Verlag. Heidelberg. 1987.
14. R. SOLOMONOFF, A formal theory of inductive inference, part 1 and part 2, Information and Control. vol. 7 (1964). pp. 224-254.