Natural halting probabilities, partial randomness, and zeta functions

Information and Computation

Volumn 204, Issue 11, 2006, Pages 1718-1739

  Calude, Cristian S ^a   Stay, Michael A ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Halting probability; Omega number; Random real; Tuatara machine; Turing machine; Zeta function; Zeta number

Indexed keywords

FUNCTIONS; MACHINERY; PARALLEL PROCESSING SYSTEMS; PROBABILITY; RANDOM PROCESSES;

HALTING PROBABILITIES; OMEGA NUMBERS; RANDOM REALS; TUATARA MACHINES; ZETA FUNCTION; ZETA NUMBERS;

TURING MACHINES;

EID: 84855190226     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.07.003     Document Type: Article

References (32)

1. C. Barker, Iota and Jot: the simplest languages?, 2001, http://ling.ucsd.edu/?barker/Iota/.
2. C. S. Calude, Information and Randomness: An Algorithmic Perspective, Second ed., Revised and Extended, Springer-Verlag, Berlin, 2002.
3. C. S. Calude, M. A. Stay, From Heisenberg to Gödel via Chaitin, Intl. J. Theor. Phys. 44(7) (2005) 1053-1065.
4. C. S. Calude, P. Hertling, B. Khoussainov, Y. Wang, Recursively enumerable reals and Chaitin Ω, numbers, Theoret. Comput. Sci. 255(2001) 125-149. (Pubitemid 32680445)
5. C. S. Calude, L. Staiger, S. A Terwijn, On partial randomness, Ann. Appl. Pure Logic 138(2006) 20-30. (Pubitemid 43348818)
6. G. J. Chaitin, On the length of programs for computing finite binary sequences, J. Assoc. Comput. Mach. 13(1966) 547-569 (Reprinted in: [9], 219-244).
7. G. J. Chaitin, A theory of program size formally identical to information theory, J. Assoc. Comput. Mach. 22(1975) 329-340 (Reprinted in: [9], 113-128).
8. G. J. Chaitin, Algorithmic Information Theory, Cambridge University Press, Cambridge, 1987 (3rd printing 1990).
9. G. J. Chaitin, Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory, Second ed., World Scientific, Singapore, 1990.
10. G. J. Chaitin, Lisp program-size complexity II-IV, Appl. Math. Comput. 52(1992) 103-126, 172-139, 141-147.
11. R. Downey, D. Hirschfeldt, Algorithmic Randomness and Complexity, Springer, Heidelberg, to appear.
12. D. Epstein, Egyptian Fractions, http://www.ics.uci.edu/~eppstein/numth/ egypt/.
13. K. Falconer, Fractal Geometry. Mathematical Foundations and Applications, Wiley & Sons, New York, 1990.
14. A. Kučera, T. A Slaman, Randomness and recursive enumerability, SIAM J. Comput. 31(2001) 199-211. (Pubitemid 33779786)
15. W. Kuich, On the entropy of context-free languages, Information and Control 16(2) (1970) 173-200.
16. G. Lekkerkerker, Voorstelling van natuurlijke getallen door een som van getallen van Fibonacci, Simon Stevin 29(1952) 190-195.
17. J. H. Lutz, The dimensions of individual strings and sequences, Inform. Comput. 187(2003) 49-79.
18. P. Martin-Löf, Complexity oscillations in infinite binary sequences, Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 19(1971) 225-230.
19. J. Miller, L. Yu, Contrasting plain and prefix-free complexity, ASL Meeting "Special Session on Computability and Randomness", Stanford, March 2005, http://www.cs.auckland.ac.nz/~nies/.
20. G. Rozenberg, A. Salomaa, Cornerstones of Undecidability, Prentice-Hall, Englewood Cliffs, 1994.
21. B. Yu. Ryabko, Coding combinatorial sources and Hasudorff dimension, Soviet Math. Dokl. 30(1) (1984) 219-222.
22. R. I. Soare, Recursion theory and Dedekind cuts, Trans. Am. Math. Soc. 140(1969) 271-294.
23. R. M. Solovay, Draft of a paper (or series of papers) on Chaitin's work... done for the most part during the period of Sept.-Dec. 1974, unpublished manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, May 1975, 215 pp.
24. L. Staiger, Kolmogorov complexity and Hausdorff dimenson, Inform. Comput. 103(1993) 159-194.
25. L. Staiger, A tight upper bound on Kolmogorov complexity and uniformly optimal prediction, Theory Comput. Syst. 31(1998) 215-229. (Pubitemid 128348786)
26. L. Staiger, The Kolmogorov complexity of real numbers, Theoret. Comput. Sci. 284(2002) 455-466. (Pubitemid 34867443)
27. L. Staiger, Private communication to C. Calude, 21 April 2006.
28. M. A. Stay, Very simple Chaitin machines for concrete AIT, Fundamenta Informaticae 68(3) (2005) 231-247.
29. M. A. Stay, Truth and Light: Physical Algorithmic Randomness, MSc thesis, University of Auckland, NZ, 2005.
30. K. Tadaki, A generalization of Chaitin's halting probability Ω, and halting self-similar sets, Hokkaido Math. J. 31(2002) 219-253.
31. http://www.kcc.org.nz/animals/tuatara.asp.
32. E. W. Weisstein, Lambert W-Function, MathWorld-A Wolfram Web Resource, http://mathworld.wolfram.com/LambertW-Function.html.