Skip to main content
×
Home

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

  • Verónica Becher (a1) and Serge Grigorieff (a2)
Abstract
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 .

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 1 *
Loading metrics...

Abstract views

Total abstract views: 94 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 25th November 2017. This data will be updated every 24 hours.