## Algorithmic information theory (1977)

### Cached

### Download Links

- [www.umcs.maine.edu]
- [minerva.ufpel.edu.br]
- [www.cs.auckland.ac.nz]
- [www.umcs.maine.edu]
- [www.cs.auckland.ac.nz]
- DBLP

### Other Repositories/Bibliography

Venue: | IBM JOURNAL OF RESEARCH AND DEVELOPMENT |

Citations: | 320 - 19 self |

### BibTeX

@ARTICLE{Chaitin77algorithmicinformation,

author = {G. J. Chaitin},

title = {Algorithmic information theory},

journal = {IBM JOURNAL OF RESEARCH AND DEVELOPMENT},

year = {1977},

volume = {21},

pages = {350--359}

}

### Years of Citing Articles

### OpenURL

### Abstract

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.