Randomness and reducibility

Journal of Computer and System Sciences

Volumn 68, Issue 1, 2004, Pages 96-114

  Downey, Rod G ^a   Hirschfeldt, Denis R ^b   LaForte, Geoff ^c  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b THE UNIVERSITY OF CHICAGO   (United States)

^c UNIVERSITY OF WEST FLORIDA   (United States)

Author keywords

Algorithmic information theory; Computably enumerable reals; Kolmogorov complexity; Relative randomness; Solovay reducibility

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; INFORMATION THEORY; RANDOM PROCESSES;

ALGORITHMIC INFORMATION THEORY; COMPUTABLY ENUMERABLE REALS; KOLMOGOROV COMPLEXITY; RELATIVE RANDOMNESS; SOLOVAY REDUCIBILITY;

COMPUTATIONAL COMPLEXITY;

EID: 0842300595     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2003.07.004     Document Type: Article

References (57)

1. K. Ambos-Spies, A. Kučera, Randomness in computability theory, in: P.A. Cholak, S. Lempp, M. Lerman, R.A. Shore (Eds.), Computability Theory and Its Applications, Boulder, CO, 1999
2. K. Ambos-Spies, A. Kučera, Contemporary Mathematics, Vol. 257, American Mathematical Society, Providence, RI, 2000, pp. 1-14.
3. K. Ambos-Spies, K. Weihrauch, X. Zheng, Weakly computable real numbers, J. Complexity 16 (2000) 676-690.
4. J. Barzdins, Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set, Soviet Math. Dokl. 9 (1968) 1251-1254.
5. C.S. Calude, A characterization of c.e. random reals, Theoret. Comput. Sci. 271 (2002) 3-14.
6. C.S. Calude, Information and Randomness, an Algorithmic Perspective, Monographs in Theoretical Computer Science, Springer, Berlin, 1994.
7. C.S. Calude, R.J. Coles, Program-size complexity of initial segments and domination reducibility, in: J. Karhumäki, H. Maurer, G. P̌un, G. Rozenberg (Eds.), Jewels are Forever, Springer, Berlin, 1999, pp. 225-237.
8. C.S. Calude, R.J. Coles, P.H. Hertling, B. Khoussainov, Degree-theoretic aspects of computably enumerable reals, in: S.B. Cooper, J.K. Truss (Eds.), Models and Computability, Leeds, 1997, London Mathematical Society Lecture Note Series, Vol 259, Cambridge University Press, Cambridge, 1999, pp. 23-39.
9. C.S. Calude, P.H. Hertling, B. Khoussainov, Y. Wang, Recursively enumerable reals and Chaitin Ω numbers, Centre for Discrete Mathematics and Theoretical Computer Science Research Report Series 59, University of Auckland, October 1997 (extended abstract in STACS 98, Lecture Notes in Computer Science, Vol. 1373, Springer, Berlin, 1998, pp. 596-606.)
10. C.S. Calude, A. Nies, Chaitin Ω numbers and strong reducibilities, J. Univ. Comput. Sci. 3 (1998) 1162-1166.
11. G.S. Ceǐtin, A pseudofundamental sequence that is not equivalent to a monotone one, Zap. Naučn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 20 (1971) 263-271 290 (in Russian with English summary).
12. G.J. Chaitin, A theory of program size formally identical to information theory, J. Assoc. Comput. Mach. 22 (1975) 329-340 (reprinted in [14]).
13. G.J. Chaitin, Algorithmic information theory, IBM J. Res. Develop. 21 (1977) 350-359 496 (reprinted in [14]).
14. G.J. Chaitin, Incompleteness theorems for random reals, Adv. in Appl. Math. 8 (1987) 119-146 (reprinted in [14]).
15. G.J. Chaitin, Information, Randomness & Incompleteness, Series in Computer Science, Vol. 8, 2nd Edition, World Scientific, River Edge, NJ, 1990.
16. B.F. Csima, Applications of computability theory to prime models and differential geometry, Ph.D. Dissertation, University of Chicago, 2003.
17. R. Downey, Some computability-theoretical aspects of reals and randomness, to appear in a volume of the Lecture Notes in Logic series published by the Association for Symbolic Logic.
18. R. Downey, D.R. Hirschfeldt, Algorithmic Randomness and Complexity, Springer Monograph, to be published.
19. R. Downey, D.R. Hirschfeldt, A. Nies, Randomness, computability, and density, SIAM J. Comput. 21 (2002) 1169-1183 (extended abstract, in: A. Ferreira, H. Reichel (Eds.), STACS 2001 Proceedings, Lecture Notes in Computer Science, Vol. 2010, Springer, Berlin, 2001, pp. 195-205.)
20. R. Downey, D.R. Hirschfeldt, A. Nies, F. Stephan, Trivial reals, to appear in: R. Downey, D. Decheng, T.S. Ping, Q.Y. Hui, M. Yasugi (Eds.), Proceedings of the 7th and 8th Asian Logic Conferences, to be published by World Scientific (extended abstract in Electronic Notes in Theoretical Computer Science, Vol. 66).
21. R. Downey, G. LaForte, Presentations of computably enumerable reals, Theoret. Comput. Sci. 284 (2002) 539-555.
22. L. Fortnow, Kolmogorov complexity, in: R.G. Downey, D.R. Hirschfeldt (Eds.), Aspects of Complexity, Minicourses in Algorithmics, Complexity, and Computational Algebra, NZMRI Mathematics Summer Meeting, Kaikoura, New Zealand, January 7-15, 2000, de Gruyter Series in Logic and its Applications, Vol. 4, de Gruyter, Berlin, 2001, pp. 73-86.
23. P. Gács, On the symmetry of algorithmic information, Soviet Math. Dokl. 15 (1974) 1477-1480.
24. C. Ho, Relatively recursive reals and real functions, Theoret. Comput. Sci. 210 (1999) 99-120.
25. K.-I. Ko, On the definition of some complexity classes of real numbers, Math. Systems Theory 16 (1983) 95-100.
26. K.-I. Ko, On the continued fraction representation of computable real numbers, Theoret. Comput. Sci. 47 (1986) 299-313.
27. A.N. Kolmogorov, Three approaches to the definition of information, Problems Inf. Transmission 1 (1965) 3-11 (in Russian).
28. A.N. Kolmogorov, Three approaches to the quantitative definition of information, Internat. J. Comput. Math. 2 (1968) 157-168.
29. A.N. Kolmogorov, Three approaches to the definition of the concept of the 'amount of information', Select. Transl. Math. Stat. Probab. 7 (1968) 293-302.
30. A. Kučera, T. Slaman, Randomness and recursive enumerability, SIAM J. Comput. 31 (2001) 199-211.
31. M. Kummer, Kolmogorov complexity and instance complexity of recursively enumerable sets, SIAM J. Comput. 25 (1996) 1123-1143.
32. A.H. Lachlan, Recursive real numbers, J. Symbolic Logic 28 (1963) 1-16.
33. L.A. Levin, On the notion of a random sequence, Soviet Math. Dokl. 14 (1973) 1413-1416.
34. L.A. Levin, Laws of information conservation (non-growth) and aspects of the foundations of probability theory, Problemy Peredaci Informatsci 10 (1974) 30-35 (in Russian).
35. L.A. Levin, The various measures of the complexity of finite objects (an axiomatic description), Soviet Math. Dokl. 17 (1976) 522-526.
36. M. Li, P. Vitanyi, An Introduction to Kolmogorov Complexity and its Applications, 2nd Edition, Springer, New York, 1997.
37. J. Lutz, The dimensions of individual strings and sequences, Inf. Comput., to appear (preliminary version: Gales and the constructive dimension of individual sequences, in: U. Montanari (Ed.), Automata, Languages, and Programming, 27th International Colloquium, ICALP 2000, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000, pp. 902-913.)
38. P. Martin-Löf, The definition of random sequences, Inform. and Control 9 (1966) 602-619.
39. E. Mayordomo, A Kolmogorov complexity characterization of constructive Hausdorff dimension, Inform Process. Lett. 84 (2002) 1-3.
40. A. Nabutovsky, S. Weinberger, The fractal geometry of Riem/Diff I, Geom. Dedicata, to appear.
41. A. Nies, Reals that compute little, to appear.
42. H. Rice, Recursive real numbers, Proc. Amer. Math. Soc. 5 (1954) 784-791.
43. C.-P. Schnorr, Process complexity and effective random tests, J. Comput. System Sci. 7 (1973) 376-388.
44. R.I. Soare, Cohesive sets and recursively enumerable Dedekind cuts, Pacific J. Math. 31 (1969) 215-231.
45. R.I. Soare, Recursion theory and Dedekind cuts, Trans. Amer. Math. Soc. 140 (1969) 271-294.
46. R.I. Soare, Recursively Enumerable Sets and Degrees, Springer, Berlin, 1987.
47. R.I. Soare, Computability and differential geometry, to appear.
48. R.J. Solomonoff, A preliminary report on a general theory of inductive inference, Tech. Report ZTB-138, Zator Company, Cambridge, MA, November, 1960.
49. R.J. Solomonoff, A formal theory of inductive inference I, Inform. and Control 7 (1964) 1-22.
50. R.J. Solomonoff, A formal theory of inductive inference II, Inform. and Control 7 (1964) 224-254.
51. R.M. Solovay, Draft of a paper (or series of papers) on Chaitin's work...done for the most part during the peroid of Sept.-Dec. 1974, May 1975, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 215p., unpublished.
52. R.M. Solovay, On random r.e. sets, in: A. Arruda, N. Da Costa, R. Chuaqui (Eds.), Non-Classical Logics, Model Theory, and Computability, Proceedings of the Third Latin-American Symposium on Mathematical Logic, Campinas, July 11-17, 1976, Studies in Logic and the Foundations of Mathematics, Vol. 89, North-Holland, Amsterdam, 1977, pp. 283-307.
53. L. Staiger, Constructive dimension equals Kolmogorov complexity, Research Report CDMTCS 210, Auckland University, 2003.
54. M. van Lambalgen, Random sequences, Ph.D. Dissertation, University of Amsterdam, 1987.
55. L. Yu, D. Ding, There is no sw-complete c.e. real, J. Symbolic Logic, to appear.
56. D. Zambella, On sequences with simple initial segments, Technical Report, Institute for Language, Logic and Information, University of Amsterdam, 1990.
57. A.K. Zvonkin, L.A. Levin, The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms, Russ. Math. Surv. 25 (1970) 83-124.