Lowness for bounded randomness

In [3], Brodhead, Downey and Ng introduced some new variations of the notions of being Martin-Löf random where the tests are all clopen sets. We explore the lowness notions associated with these randomness notions. While these bounded notions seem far from classical notions with infinite tests like...

Full description

Bibliographic Details
Main Authors: Downey, Rod., Ng, Keng Meng
Other Authors: School of Physical and Mathematical Sciences
Format: Journal Article
Language:English
Published: 2013
Online Access:https://hdl.handle.net/10356/96557
http://hdl.handle.net/10220/10307
_version_ 1811688884034076672
author Downey, Rod.
Ng, Keng Meng
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Downey, Rod.
Ng, Keng Meng
author_sort Downey, Rod.
collection NTU
description In [3], Brodhead, Downey and Ng introduced some new variations of the notions of being Martin-Löf random where the tests are all clopen sets. We explore the lowness notions associated with these randomness notions. While these bounded notions seem far from classical notions with infinite tests like Martin-Löf and Demuth randomness, the lowness notions associated with bounded randomness turn out to be intertwined with the lowness notions for these two concepts. In fact, in one case, we get a new and likely very useful characterization of K-triviality.
first_indexed 2024-10-01T05:39:18Z
format Journal Article
id ntu-10356/96557
institution Nanyang Technological University
language English
last_indexed 2024-10-01T05:39:18Z
publishDate 2013
record_format dspace
spelling ntu-10356/965572020-03-07T12:34:42Z Lowness for bounded randomness Downey, Rod. Ng, Keng Meng School of Physical and Mathematical Sciences In [3], Brodhead, Downey and Ng introduced some new variations of the notions of being Martin-Löf random where the tests are all clopen sets. We explore the lowness notions associated with these randomness notions. While these bounded notions seem far from classical notions with infinite tests like Martin-Löf and Demuth randomness, the lowness notions associated with bounded randomness turn out to be intertwined with the lowness notions for these two concepts. In fact, in one case, we get a new and likely very useful characterization of K-triviality. 2013-06-13T03:20:21Z 2019-12-06T19:32:30Z 2013-06-13T03:20:21Z 2019-12-06T19:32:30Z 2012 2012 Journal Article Downey, R., & Ng, K. M. (2012). Lowness for bounded randomness. Theoretical Computer Science, 460, 1-9. 0304-3975 https://hdl.handle.net/10356/96557 http://hdl.handle.net/10220/10307 10.1016/j.tcs.2012.06.004 en Theoretical computer science © 2012 Elsevier B.V.
spellingShingle Downey, Rod.
Ng, Keng Meng
Lowness for bounded randomness
title Lowness for bounded randomness
title_full Lowness for bounded randomness
title_fullStr Lowness for bounded randomness
title_full_unstemmed Lowness for bounded randomness
title_short Lowness for bounded randomness
title_sort lowness for bounded randomness
url https://hdl.handle.net/10356/96557
http://hdl.handle.net/10220/10307
work_keys_str_mv AT downeyrod lownessforboundedrandomness
AT ngkengmeng lownessforboundedrandomness