Random reals à la Chaitin with or without prefix-freeness

Authors:
Verónica Becher;Serge Grigorieff
Affiliations:
Departamento de Computación, FCEyN, Universidad de Buenos Aires, Argentina and Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina;LIAFA, CNRS and Université Paris 7, 2, pl. Jussieu 75251 Paris Cedex 05, France
Venue:
Theoretical Computer Science
Year:
2007

Citing 6
Cited 0

Algorithmic information theory

Algorithmic information theory
An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)
A Theory of Program Size Formally Identical to Information Theory

Journal of the ACM (JACM)
Recursively Enumerable Reals and Chaitin Omega Numbers

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Visualization 2001 Conference (Acm

Visualization 2001 Conference (Acm
Randomness and universal machines

Journal of Complexity

Quantified Score

Hi-index	5.23

Visualization

Abstract

We give a general theorem that provides examples of n-random reals à la Chaitin, for every n≥1; these are halting probabilities of partial computable functions that are universal by adjunction for the class of all partial computable functions, The same result holds for the class functions of partial computable functions with prefix-free domain. Thus, the usual technical requirement of prefix-freeness on domains is an option which we show to be non-critical when dealing with universality by adjunction. We also prove that the condition of universality by adjunction (which, though particular, is a very natural case of optimality) is essential in our theorem.