Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T11:46:49.499Z Has data issue: false hasContentIssue false

Schnorr randomness

Published online by Cambridge University Press:  12 March 2014

Rodney G. Downey
Affiliation:
School of Mathematical and Computing Sciences, Victoria University, Po Box 600. Wellington, New Zealand, E-mail: Rod.Downey@vuw.ac.nz
Evan J. Griffiths
Affiliation:
School of Mathematical and Computing Sciences, Victoria University, Po Box 600. Wellington, New Zealand, E-mail: griffiths@member.ams.org

Abstract.

Schnorr randomness is a notion of algorithmic randomness for real numbers closely related to Martin-Löf randomness. After its initial development in the 1970s the notion received considerably less attention than Martin-Löf randomness, but recently interest has increased in a range of randomness concepts. In this article, we explore the properties of Schnorr random reals, and in particular the c.e. Schnorr random reals. We show that there are c.e. reals that are Schnorr random but not Martin-Löf random, and provide a new characterization of Schnorr random real numbers in terms of prefix-free machines. We prove that unlike Martin-Löf random c.e. reals, not all Schnorr random c.e. reals are Turing complete, though all are in high Turing degrees. We use the machine characterization to define a notion of “Schnorr reducibility” which allows us to calibrate the Schnorr complexity of reals. We define the class of “Schnorr trivial” reals, which are ones whose initial segment complexity is identical with the computable reals, and demonstrate that this class has non-computable members.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2004

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