Verónica Becher

Random reals and possibly infinite computations Part I: Randomness in the first jump of the halting problem

2005, Journal of Symbolic Logic 70 (3), 891-913, 2005
Citas: 23
Agregar PDF Importar citas Importar citas SCRAPME Plots Conexiones

Autor(es)

Verónica Becher and Serge Grigorieff

URL Pública

https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/random-reals-and-possibly-infinite-computations-part-i-randomness-in/F4E77BC74322B8390EBCB6CC37CDDB56

Abstract

Using possibly infinite computations on universal monotone Turing machines, we prove Martin-Löf randomness in ∅′ of the probability that the output be in some set under complexity assumptions about .

Plot de citas