Recursively enumerable reals and chaitin Ω numbers

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

Volumn 1373 LNCS, Issue , 1998, Pages 596-606

  Calude, Cristian S ^a   Hertling, Peter H ^a   Khoussainov, Bakhadyr ^a   Wang, Yongge ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

REAL NUMBER; UNIT INTERVALS;

COMPUTER SCIENCE; TURING MACHINES;

MACHINERY;

EID: 78649893518     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028594     Document Type: Conference Paper

References (25)

1. C. H. Bennett, M. Gardner. The random number omega bids fair to hold the mysteries of the universe, Scientific American 241(1979), 20-34.
2. C. H. Bennett. Logical depth and physical complexity, in R. Herken (ed.). The Universal Turing Machine. A Half-Century Survey, Oxford University Press, Oxford, 1988, 227-258.
3. D. S. Bridges, F. Richman. Varieties of Constructive Mathematics, Cambridge University Press, Cambridge, 1987.
4. C. Calude. Information and Randomness. An Algorithmic Perspective, Springer-Verlag, Berlin, 1994.
5. C. Calude and C. Grozea. Kraft-Chaitin inequality revisited, J. UCS 5(1996), 306-310.
6. C. Calude, F. W. Meyerstein. Is the universe lawful?, Chaos, Solitons & Fractals, (to appear).
7. C. Calude, A. Salomaa. Algorithmicalty coding the universe, in G. Rozenberg, A. Salomaa (eds.), Developments in Language Theory, World Scientific, Singapore, 1994, 472-492.
8. G. J. Chaitin. On the length of programs for computing finite binary sequences, J. Assoc. Comput. Mach. 13(1966), 547-569. (Reprinted in: [11], 219-244)
9. G. J. Chaitin. A theory of program size formally identical to information theory, J. Assoc. Comput. Mach. 22(1975), 329-340. (Reprinted in: [11], 113-128)
10. G. J. Chaitin. Algorithmic information theory, IBM J. Res. Develop. 21(1977), 350-359, 496. (Reprinted in: [11], 44-58)
11. G. J. Chaitin. Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory, World Scientific, Singapore, 1987. (2nd ed., 1990)
12. G. J. Chaitin. The Limits of Mathematics, Springer-Verlag, Singapore, 1997.
13. D. Juedes, J. Lathrop, and J. Lutz. Computational depth and reducibility, Theoret. Comput. Sci. 132 (1994), 37-70.
14. S. Kautz. Degrees of Random Sets, PhD Thesis, Cornell University, Ithaca, 1991.
15. Ker-I. Ko. Complexity Theory of Real Functions, Birkhäuser, Boston, 1991.
16. A. N. Kolmogorov. Three approaches for defining the concept of "information quantity", Problems Inform. Transmission 1(1965), 3-11.
17. 0-classes and complete extensions of PA, H.-D. Ebbinghaus, G. H. Müller, G. E. Sacks (eds.), Recursion Theory Week (Oberwolfach, 1984), Lecture Notes in Math. 1141, Springer-Verlag, Berlin, 1985, 245-259.
18. L. A. Levin. On the notion of a random sequence, Soviet Math. Dokl. 14(1973), 1413-1416.
19. P. Martin-Löf. The definition of random sequences, Inform. and Control 9(1966), 602-619.
20. C. P. Schnorr. Process complexity and effective random tests, J. Comput. System Sci. 7(1973), 376-388.
21. R. I. Soare. Recursively Enumerable Sets and Degrees, Springer-Verlag, Berlin, 1987.
22. R.J. Solomonoff. A formal theory of inductive inference, Part 1 and Part 2, Inform. and Control 7(1964), 1-22 and 224-254.
23. R. Solovay. Draft of a paper (or series of papers) on Chaitin's work ... done for the most part during the period of Sept. - Dec. 1975, unpublished manuscript, IBM T. J. Watson Research Center, Yorktown Heights, New York, May 1975, 215 pp.
24. Y. Wang. Randomness and Complexity, PhD Thesis, Universität Heidelberg, Germany, 1996.
25. K. Weihrauch. Computability, Springer-Vertag, Berlin, 1987.