This paper reviews algorithmic information theory, which is an attempt to apply information-theoretic and probabilistic ideas to recursive function theory. Typical concerns in this approach are, for example, the number of bits of information required to specify an algorithm, or the probability that a program whose bits are chosen by coin flipping produces a given output. During the past few years the definitions of algorithmic information theory have been reformulated. The basic features of the new formalism are presented here and certain results of R. M. Solovay are reported.
|
304
|
Three approaches to the quantitative definition of information
– Kolmogorov
- 1965
|
|
298
|
Theory of Self-Reproducing Automata
– Neumann
- 1966
|
|
240
|
The definition of random sequences
– Martin-Löf
- 1966
|
|
233
|
A Formal Theory of Inductive Inference
– Solomonoff
- 1964
|
|
219
|
A theory of program size formally identical to information theory
– Chaitin
- 1975
|
|
161
|
On the length of programs for computing finite binary sequences: Statistical considerations
– Chaitin
- 1969
|
|
109
|
The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms,” Russ
– Zvonkin, Levin
- 1970
|
|
102
|
A Fast Monte-Carlo Test for Primality
– Solovay, Strassen
- 1977
|
|
73
|
On the notion of a random sequence
– Levin
- 1973
|
|
69
|
Seminumerical Algorithms. The Art of Computer Programming, Volume 2, Second Edition
– Knuth
- 1981
|
|
58
|
Logical basis for information theory and probability theory
– Kolmogorov
- 1968
|
|
58
|
Process complexity and effective random tests
– Schnorr
- 1973
|
|
54
|
Laws of information conservation (non-growth) and aspects of the foundation of probability theory
– Levin
- 1974
|
|
44
|
A variant of the Kolmogorov concept of complexity
– Loveland
- 1969
|
|
40
|
Information-theoretic characterizations of recursive infinite strings. TheoreticalComputer Science 2:45-48
– Chaitin
- 1976
|
|
37
|
Randomness and mathematical proof
– Chaitin
- 1975
|
|
34
|
A model of set theory in which every set of reals is Lebesgue measurable
– SOLOVAY
- 1970
|
|
32
|
Information-theoretic limitations of formal systems
– Chaitin
- 1974
|
|
26
|
Computational complexity and probability constructions
– Willis
- 1970
|
|
21
|
Universal Gambling Schemes and the Complexity Measures of Kolmogorov and Chaitin
– Cover
- 1974
|
|
20
|
On tables of random numbers
– Kolmogorov
- 1963
|
|
19
|
Information-theoretic computational complexity
– Chaitin
- 1974
|
|
17
|
Complexity oscillations in infinite binary sequences. Zeitschrift fur Wahrscheinlichkeitstheorie und Verwandte Gebiete
– Martin-Lof
- 1971
|
|
16
|
Algorithmic Entropy of Sets
– Chaitin
- 1976
|
|
15
|
On The Difficulty of Computations
– Chaitin
- 1970
|
|
14
|
Various Measures of Complexity for Finite Objects (Axiomatic Description
– Levin
- 1976
|
|
14
|
Logical reversibility of computation, IBM
– Bennett
- 1973
|
|
12
|
To a mathematical definition of ‘life
– Chaitin
- 1970
|
|
12
|
On programming: An interim report on the SETL project, Installment II: The SETL language and examples of its use
– Schwartz
- 1973
|
|
11
|
Uniform Tests of Randomness
– Levin
- 1976
|
|
11
|
Investigations in the theory of descriptive complexity
– Gewirtz
- 1974
|
|
10
|
On the notion of randomness
– Martin-Löf
- 1968
|
|
9
|
Mathematical logic as based on the theory of types, From Frege to Godel: ASource Book
– Russell
- 1908
|
|
7
|
Problems of Formulation for Artificial Intelligence
– Minsky
- 1962
|
|
7
|
Minimal-program complexity of pseudo-recursive and pseudo-random sequences
– Daley
- 1975
|
|
6
|
On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
– Chaitin
- 1969
|
|
5
|
Program Size, Oracles, and the Jump Operation
– Chaitin
- 1977
|
|
4
|
On Kolmogorov's complexity and information
– Kamae
- 1973
|
|
4
|
Mathematical Logic for Computer Scientists
– Levin
- 1974
|
|
3
|
The Information Theoretic Approach to Cryptography
– Hellman
- 1974
|
|
2
|
Complexity Based Induction Systems: Comparisons and Convergence Theorems,” Report RR-329
– Solomonoff
- 1976
|
|
2
|
On the principle of conservation of information in intuitionistic mathematics
– Levin
- 1976
|
|
2
|
Theories of Probability---An Examination of Foundations
– Fine
- 1973
|
|
2
|
Mathematical logic as based on the theory of types," in From Frege to
– Russell
- 1967
|
|
2
|
Logical Reversibility of Computation," IBM
– Bennett
- 1973
|
|
2
|
To A Mathematical Definition of
– Chaitin
- 1970
|
|
2
|
On the Principle of Conservation of Information
– Levin
- 1976
|
|
1
|
An Inductive Card Game
– Gardner
- 1959
|
|
1
|
The Literature on von Mises
– Martin-Löf
- 1969
|
|
1
|
On the Notion of Randomness," Intuitionism and Proof Theory
– Martin-Lof
- 1970
|
|
