Bounded randomness

Authors:
Paul Brodhead;Rod Downey;Keng Meng Ng
Affiliations:
Indian River State College, Fort Pierce, Florida;School of Math, Statistics, & Operations Research, Victoria University, Wellington, New Zealand;School of Physical & Mathematical Sciences, Nanyang Technological University, Singapore
Venue:
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Year:
2012

Citing 5
Cited 1

Array nonrecursive degrees and genericity

Computability, enumerability, unsolvability
Recursive computational depth

Information and Computation
Visualization 2001 Conference (Acm

Visualization 2001 Conference (Acm
Turing degrees of reals of positive effective packing dimension

Information Processing Letters
Computability and Randomness

Computability and Randomness

Lowness for bounded randomness

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce some new variations of the notions of being Martin-Löf random where the tests are all clopen sets. We explore how these randomness notions relate to classical randomness notions and to degrees of unsolvability.