hal-00644785, version 1

Algorithmic tests and randomness with respect to a class of measures

Laurent Bienvenu () ^a, 1, Peter Gacs () ^b, 2, Mathieu Hoyrup () ³, Cristobal Rojas () ^c, 4, Alexander Shen (, ) ⁵

Proceedings of the Steklov Institute of Mathematics 274, 1 (2011) 34-89

• a –  CNRS
• b –  Boston University
• c –  Universidad Andrés Bello
• 1:  Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA)
• http://www.liafa.jussieu.fr/
  CNRS : UMR7089 – Université Paris VII - Paris Diderot 2, place Jussieu, Case 7014, 75251 Paris Cedex 05 - Tél: +33(0)1.44.27.68.45 - Fax: +33(0)1.44.27.68.49 France
• 2:  Computer Science Department [Boston] (Boston University)
• http://www.cs.bu.edu/
  Boston University Department of Computer Science Boston University 111 Cummington St, Room 138 Boston, MA 02215 United States
• 3:  CARTE (INRIA Nancy - Grand Est / LORIA)
• 
  CNRS : UMR7503 – INRIA – Université de Lorraine France
• 4:  Department of Mathematics - University of Toronto
• http://www.math.toronto.edu/
  University of Toronto Department of Mathematics - University of Toronto - Bahen Centre - 40 St. George St. - Toronto, Ontario - CANADA - M5S 2E4 Canada
• 5:  Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM)
• http://www.lirmm.fr
  CNRS : UMR5506 – Université Montpellier II - Sciences et techniques CC 477, 161 rue Ada, 34095 Montpellier Cedex 5 France

Bibliographic reference

• Type of document: Articles in peer-reviewed journal
• Domain:

  Mathematics/Probability

  Computer Science/Information Theory and Coding

  Mathematics/Information Theory

• Title: Algorithmic tests and randomness with respect to a class of measures
• Abstract: This paper offers some new results on randomness with respect to classes of measures, along with a didactical exposition of their context based on results that appeared elsewhere. We start with the reformulation of the Martin-Löf definition of randomness (with respect to computable measures) in terms of randomness deficiency functions. A formula that expresses the randomness deficiency in terms of prefix complexity is given (in two forms). Some approaches that go in another direction (from deficiency to complexity) are considered. The notion of Bernoulli randomness (independent coin tosses for an asymmetric coin with some probability p of head) is defined. It is shown that a sequence is Bernoulli if it is random with respect to some Bernoulli measure Bp. A notion of "uniform test" for Bernoulli sequences is introduced which allows a quantitative strengthening of this result. Uniform tests are then generalized to arbitrary measures. Bernoulli measures Bp have the important property that p can be recovered from each random sequence of Bp. The paper studies some important consequences of this orthogonality property (as well as most other questions mentioned above) also in the more general setting of constructive metric spaces.
• ACM Classification:

  F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory

  F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.2: Computability theory

• Full text language: English
• Journal title:

  Proceedings of the Steklov Institute of Mathematics
  Publisher	MAIK Nauka/Interperiodica (МАИК Наука/Интерпериодика)
  ISSN	0081-5438 (eISSN : 1531-8605)

• Publication date: 2011-11-25
• Audience: international
• Commercial editor: Steklov Institute of Mathematics
• Volume: 274
• Number: 1
• Pagination: 34-89
• DOI: 10.1134/S0081543811060058
• Full text from editor (url): http://www.springerlink.com/content/x5w44l14417m5642/
• See also (url): http://arxiv.org/abs/1103.1529

Attached file list to this document: 

• hal-00644785, version 1
• http://hal.inria.fr/hal-00644785
• oai:hal.inria.fr:hal-00644785
• From: Mathieu Hoyrup <>
• Submitted on: Friday, 25 November 2011 11:32:09
• Updated on: Friday, 21 September 2012 13:55:41