Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T22:49:52.223Z Has data issue: false hasContentIssue false

Random reals and possibly infinite computations Part I: Randomness in ∅′

Published online by Cambridge University Press:  12 March 2014

Verónica Becher
Affiliation:
Departamento de Computación, Fceyn Universidad de Buenos Aires, ArgentinaE-mail:, vbecher@dc.uba.ar
Serge Grigorieff
Affiliation:
Liafa, Université Paris7, 2, Pl. Jussieu 75251 Paris Cedex 05, FranceE-mail:, seg@liafa.jussieu.fr

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 .

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable