Very simple chaitin machines for concrete AIT

Fundamenta Informaticae

Volumn 68, Issue 3, 2005, Pages 231-247

  Stay, Michael ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; INFORMATION THEORY; NUMBER THEORY; RANDOM PROCESSES;

ALGORITHMIC INFORMATION THEORY; BLANK-ENDMARKER MACHINES; LAMBDA OPERATOR;

TURING MACHINES;

EID: 33645297685     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. Barker, C. "Iota and Jot: the simplest languages?" 2001. http://ling.ucsd.edu/~barker/Iota/
2. Barker, C. "Zot." 2002. http://ling.ucsd.edu/~barker/Iota/zot.html
3. Calude, C. S. Information and Randomness - An Algorithmic Perspective. 2nd Edition, Revised and Extended, Springer-Verlag, Berlin, 2002. p. 24, 104
4. Calude, C., Dinneen, M. J., and Shu, C.-K. "Computing a glimpse of randomness," Experimental Mathematics, 2 (2002), 369-378
5. Chaitin, G. J. "On the lengths of programs for computing binary sequences." J. Assoc. Comput. Mach. 13, 549-569, 1966.
6. Chaitin, G. J. "A theory of program size formally identical to information theory," Journal of the ACM 22 (1975), pp. 329-340. http://www.cs.auckland.ac.nz/CDMTCS/chaitin/acm75.pdf
7. Chaitin, G. J. "algorithmic information theory." IBM Journal of Research and Development 21 (1977), pp. 350-359, 496.
8. Chaitin, G. J. algorithmic Information Theory. Cambridge University Press, Cambridge, 1987. http: //www.cs.auckland.ac.nz/CDMTCS/chaitin/cup.html
9. Chaitin, G. J. "An Invitation to algorithmic Information Theory," DMTCS'96 Proceedings, Springer Verlag, Singapore, 1997, pp. 1-23. http://www.cs.auckland.ac.nz/CDMTCS/chaitin/inv.html
10. Chaitin, G. J. "Elegant Lisp Programs," People and Ideas in Theoretical Computer Science, C. Calude, ed. Springer-Verlag Singapore, 1999, pp. 32-52. http://www.cs.auckland.ac.nz/CDMTCS/chaitin/lisp.html
11. Church, A. "An unsolvable problem of elementary number theory, " American Journal of Mathematics, 58 (1936), pp. 345-363.
12. Church, A. "A note on the Entscheidungsproblem" Journal of Symbolic Logic, 1 (1936), pp. 40-41.
13. de Bruijn, N. G. "Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation," Indagationes Mathematicae 34, 381-392, 1972.
14. Fokker, J. "The systematic construction of a one-combinator basis for Lambda-terms," Formal Aspects of Computing 4:776-780.1992. http://www.cs.uu.nl/people/jeroen/article/combinat/combinat.ps
15. Kolmogorov, A. N. "Three approaches to the quantitative definition of information." Prob. Inform. Transmission. 1, pp. 4-7, 1965.
16. Rudiak-Gould, B. "Lazy-K." http://homepages.cwi.nl/~tromp/cl/lazy-k.html
17. Shannon, C. E. "A mathematical theory of communication," Bell System Technical Journal, vol. 27, pp. 379-423 and 623-656, July and October, 1948. http://cm.bell-labs.com/cm/ms/what/shannonday/paper.html
18. Solomonoff, R. J. "A formal theory of inductive inferrence I, II." Inform. Control 7, 1-22, 224-254. 1964.
19. Tromp, J. "Binary Lambda Calculus and Combinatory Logic." Sep 14, 2004. http://homepages.cwi.nl/~tromp/cl/LC.pdf
20. Turing, A. "On computable numbers, with an application to the Entscheidungsproblem," Proceedings of the London Mathematical Society, Series 2, 42 (1936), pp 230-265. Errata appeared in Series 2, 43 (1937), pp 544-546.