Another example of higher order randomness

Fundamenta Informaticae

Volumn 51, Issue 4, 2002, Pages 325-338

  Becher, Verónica ^a   Chaitin, Gregory ^b  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Infinite computations; Program size complexity; Randomness

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAM LISTINGS; COMPUTER SIMULATION; PROBABILITY; PROBLEM SOLVING;

FINITE SIZE COMPLEXITY;

RANDOM PROCESSES;

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

References (15)

1. V. Becher, S. Daicz, and G. Chaitin. A highly random number. In C.S. Calude, M.J. Dineen, and S. Sburlan, editors, Combinatorics, Computability and Logic: Proceedings of the Third Discrete Mathematics and Theoretical Computer Science Conference (DMTCS'01), Springer-Verlag London, pp. 55-68, 2001.
2. C. Calude. Information and Randomness. An Algorithmic Perspective. Springer-Verlag, Berlin, 1994.
3. C.S. Calude, A. Nies. Chaitin Ω numbers and strong reducibilities, J. UCS 3, pp. 1161-1166, 1997.
4. C. Calude. A characterization of c.e. random reals. Theoretical Computer Science 271(1-2), pp. 3-14, 2002.
5. G.J. Chaitin. A theory of program size formally identical to information theory. J. ACM, 22, pp. 329-340, 1975.
6. G.J. Chaitin. Algorithmic entropy of sets. Computers & Mathematics with Applications, 2, pp. 233-245, 1976.
7. G.J. Chaitin. Algorithmic Information Theory. Cambridge University Pres, Cambridge, 1987.
8. G.J. Chaitin. Exploring Randomness. Springer-Verlag, London, 2001.
9. M. Ferbus-Zanda and S. Grigorieff. Is randomness "native" to Computer Science?. Logic in Computer Science Column. Bulletin of EATCS, vol 74., pp. 78-118, 2001.
10. L.G. Kraft. A device for quantizing, grouping and coding amplitude modulated pulses. Master'S thesis, Dept. of Electrical Engineering, M.I.T., Cambridge, Massachusets, 1949.
11. P.G. Odifreddi. Classical Recursion Theory. North Holland, Amsterdam, Vol. 1, 1989.
12. J.R.M. Shoenfield. Recursion theory, Lecture Notes in Logic, vol. 1, 1993, reprinted 2001, A.K. Peters, Ltd.
13. R. Soare. Recursion theory and Dedekind cuts. Trans. Amer. Math. Soc., vol. 140, 271-294, 1969.
14. R.M. Solovay. On random r.e. sets. In A.I. Arruda, N.C.A. da Costa, and R. Chuaqui, editors, Non-Classical Logics, Model Theory and Computability, pp. 283-307. North-Holland Publishing Company, 1977.
15. A. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 2nd series, 42, pp. 230-265, 1936.