INVESTIGADORES
BECHER veronica Andrea
artículos
Título:
RAMDOM REALS AND POSSIBLY INFINITE COMPUTATIONS. Part I: randomnes in the first jump of the halting problem
Autor/es:
BECHER, VERÓNICA; GRIGOREFF, SERGE
Revista:
JOURNAL OF SYMBOLIC LOGIC, THE
Editorial:
Association for Symbolic Logic
Referencias:
Año: 2005 vol. 70 p. 891 - 913
ISSN:
0022-4812
Resumen:
We consider possibly infinite computations on universal monotone Turing machines with outputs in the set of finite and infinite strings of zeros and ones, We prove necessary and sufficient condition of an output set such that that probability that a universal Turing machine gives and output in that set be Martin-Löf random in the first jump of the halting problem.
