HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
Author:
- 1 August 2002
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 13 (04) , 587-612
Abstract
The traditional theory of Kolmogorov complexity and algorithmic probability focuses on monotone Turing machines with one-way write-only output tape. This naturally leads to the universal enumerable Solomonoff-Levin measure. Here we introduce more general, nonenumerable but cumulatively enumerable measures (CEMs) derived from Turing machines with lexicographically nondecreasing output and random input, and even more general approximable measures and distributions computable in the limit. We obtain a natural hierarchy of generalizations of algorithmic probability and Kolmogorov complexity, suggesting that the "true" information content of some (possibly infinite) bitstring x is the size of the shortest nonhalting program that converges to x and nothing but x on a Turing machine that can edit its previous outputs. Among other things we show that there are objects computable in the limit yet more random than Chaitin's "number of wisdom" Omega, that any approximable measure of x is small for any x lacking a short description, that there is no universal approximable distribution, that there is a universal CEM, and that any nonenumerable CEM of x is small for any x lacking a short enumerating program. We briefly mention consequences for universes sampled from such priors.Keywords
This publication has 18 references indexed in Scilit:
- New Error Bounds for Solomonoff PredictionJournal of Computer and System Sciences, 2001
- Quantum information and computationNature, 2000
- On relative randomnessAnnals of Pure and Applied Logic, 1993
- Occam's RazorInformation Processing Letters, 1987
- On the relation between descriptional complexity and algorithmic probabilityTheoretical Computer Science, 1983
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1969
- The definition of random sequencesInformation and Control, 1966
- Limiting recursionThe Journal of Symbolic Logic, 1965
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme IMonatshefte für Mathematik, 1931