Randomness for non-computable measures

Authors:
Adam R. Day and Joseph S. Miller

Journal:
Trans. Amer. Math. Soc. **365** (2013), 3575-3591

MSC (2010):
Primary 03D32; Secondary 68Q30, 03D30

DOI:
https://doi.org/10.1090/S0002-9947-2013-05682-6

Published electronically:
January 17, 2013

MathSciNet review:
3042595

Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Different approaches have been taken to defining randomness for non-computable probability measures. We will explain the approach of

Reimann and Slaman, along with the uniform test approach first introduced by Levin and also used by Gács, Hoyrup and Rojas. We will show that these approaches are fundamentally equivalent.

Having clarified what it means to be random for a non-computable probability measure, we turn our attention to Levin's *neutral measures*, for which all sequences are random. We show that every PA degree computes a neutral measure. We also show that a neutral measure has no least Turing degree representation and explain why the framework of the continuous degrees (a substructure of the enumeration degrees studied by Miller) can be used to determine the computational complexity of neutral measures. This allows us to show that the Turing ideals below neutral measures are exactly the Scott ideals. Since is an atom of a neutral measure if and only if it is computable from (every representation of) , we have a complete understanding of the possible sets of atoms of a neutral measure. One simple consequence is that every neutral measure has a Martin-Löf random atom.

**1.**Patrick Billingsley.*Convergence of Probability Measures*.

Wiley, 2nd edition, 1999. MR**1700749 (2000e:60008)****2.**R.G. Downey and D.R. Hirschfeldt.*Algorithmic Randomness and Complexity*.

Springer-Verlag, New York, 2010. MR**2732288****3.**Peter Gács.

Uniform test of algorithmic randomness over a general space.*Theoret. Comput. Sci.*, 341(1-3):91-137, 2005. MR**2159646 (2006m:68057)****4.**Mathieu Hoyrup and Cristóbal Rojas.

Computability of probability measures and Martin-Löf randomness over metric spaces.*Inform. and Comput.*, 207(7):830-847, 2009. MR**2519075 (2011b:03066)****5.**Carl G. Jockusch, Jr. and Robert I. Soare.

classes and degrees of theories.*Trans. Amer. Math. Soc.*, 173:33-56, 1972. MR**0316227 (47:4775)****6.**Shizuo Kakutani.

A generalization of Brouwer's fixed point theorem.*Duke Mathematical Journal*, 8:457-459, 1941. MR**0004776 (3:60c)****7.**Daniel Lacombe.

Quelques procédés de définition en topologie recursive.

In*Constructivity in mathematics: Proceedings of the colloquium held at Amsterdam, 1957 (edited by*, Studies in Logic and the Foundations of Mathematics, pages 129-158. North-Holland Publishing Co., 1959. MR

A. Heyting)**0112838 (22:3687)****8.**L. A. Levin.

The concept of a random sequence.*Soviet Mathematics Doklady*, 14(5):1413-1416, 1973. MR**0366096 (51:2346)****9.**L. A. Levin.

Uniform tests for randomness.*Soviet Math. Dokl.*, 17(2):337-340, 1976. MR**0414222 (54:2325)****10.**L.A. Levin and A.K. Zvonkin.

The complexity of finite objects and the development of the concepts of information and randomness of means of the theory of algorithms.*Russian Math. Surveys*, 25(6), 1970. MR**0307889 (46:7004)****11.**P. Martin-Löf.

The definition of random sequences.*Information and Control*, 9:602-619, 1966. MR**0223179 (36:6228)****12.**Joseph S. Miller.

Degrees of unsolvability of continuous functions.*J. Symbolic Logic*, 69(2):555-584, 2004. MR**2058189 (2005b:03102)****13.**André Nies.*Computability and randomness*.

Oxford University Press, 2009. MR**2548883 (2011i:03003)****14.**Jan Reimann.

Effectively closed sets of measures and randomness.*Ann. Pure Appl. Logic*, 156(1):170-182, 2008. MR**2474448 (2010a:03043)****15.**Jan Reimann and Theodore A. Slaman.

Measures and their random reals.

To appear.**16.**M. Rozinas.

The semilattice of e-degrees.

In*Recursive functions (Russian)*, pages 71-84. Ivanov. Gos. Univ., Ivanovo, 1978. MR**604944 (82i:03057)****17.**Alan L. Selman.

Arithmetical reducibilities. I.*Zeitschrift für Mathematische Logik und Grundlagen der Mathematik*, 17:335-350, 1971. MR**0304150 (46:3285)****18.**A. M. Turing.

On computable numbers, with an application to the Entscheidungsproblem. A correction.*Proceedings of the London Mathematical Society. Second Series*, 43:544-546, 1937.**19.**Klaus Weihrauch.*Computable analysis, an introduction*.

Springer-Verlag, Berlin, 2000. MR**1795407 (2002b:03129)**

Retrieve articles in *Transactions of the American Mathematical Society*
with MSC (2010):
03D32,
68Q30,
03D30

Retrieve articles in all journals with MSC (2010): 03D32, 68Q30, 03D30

Additional Information

**Adam R. Day**

Affiliation:
School of Mathematics, Statistics and Operations Research, Victoria University of Wellington, Wellington 6140, New Zealand

Email:
adam.day@msor.vuw.ac.nz

**Joseph S. Miller**

Affiliation:
Department of Mathematics, University of Wisconsin, Madison, Wisconsin 53706-1388

Email:
jmiller@math.wisc.edu

DOI:
https://doi.org/10.1090/S0002-9947-2013-05682-6

Received by editor(s):
November 21, 2010

Received by editor(s) in revised form:
August 10, 2011

Published electronically:
January 17, 2013

Additional Notes:
The second author was supported by the National Science Foundation under grants DMS-0945187 and DMS-0946325, the latter being part of a Focused Research Group in Algorithmic Randomness.

Article copyright:
© Copyright 2013
American Mathematical Society

The copyright for this article reverts to public domain 28 years after publication.