Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-18T00:48:30.738Z Has data issue: false hasContentIssue false

Every 2-random real is Kolmogorov random

Published online by Cambridge University Press:  12 March 2014

Joseph S. Miller*
Affiliation:
School of Mathematical and Computing Sciences, Victoria University, P.O. Box 600 Wellington, New Zealand, E-mail: Joe.Miller@mcs.vuw.ac.nz

Abstract.

We study reals with infinitely many incompressible prefixes. Call A ∈ 2ωKolmogorov random if . where C denotes plain Kolmogorov complexity. This property was suggested by Loveland and studied by Martin-Löf. Schnorr and Solovay. We prove that 2-random reals are Kolmogorov random. Together with the converse—proved by Nies. Stephan and Terwijn [11]—this provides a natural characterization of 2-randomness in terms of plain complexity. We finish with a related characterization of 2-randomness.

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