321

Algorithmic information theory
– G. J. Chaitin
 1977

331

A Theory of Program Size Formally Identical to Information Theory
– Gregory J. Chaitin
 1975

6083

A mathematical theory of communication
– C E Shannon
 1948

523

Three approaches to the quantitative definition of information
– A N Kolmogorov
 1965

227

On the Length of Programs for Computing Finite Binary Sequences
– Gregory J. Chaitin
 1966

1690

An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition
– Ming Li, Paul Vitanyi
 1997

3

The Systematic Construction of a OneCombinator Basis
– J. Fokker, Vakgroep Nformatica, Jeroen Fokker
 1989

100

A note on the entscheidungsproblem
– A Church
 1936

2

Testing an optimising compiler by generating random lambda terms
– Michal H Palka, Koen Claessen, Alejandro Russo, John Hughes
 2011

108

Generalized Kraft inequality and arithmetic coding
– J Rissanen

400

A universal prior for integers and estimation by minimum description length. The Annals of Statistics 11(2
– J Rissanen
 1983

732

Structure and interpretation of computer programs
– H Abelson, Sussman GJ, J Sussman
 1985

2

Iota and Jot: the simplest languages?” 2001.http://ling.ucsd.edu/~barker/Iota/ [2] Barker, C. “Zot.” 2002.http://ling.ucsd.edu/~barker/Iota/zot.html [3] Calude, C. S. Information and Randomness  An Algorithmic Perspective. 2nd Edition, Revised and Extend
– C Barker
 2002

1

paper.html [18
– July, October
 1948

19

The Theory of GroupReduced Distributions
– H Redfield
 1927

3

The Complexity of finite objects and the Algorithmic
– A K Zvonkin, L A Levin
 1970

4

Information and Randomness: An Algorithmic Perspective (Texts
– Cristian S Calude
 2002

7

On the KolmogorovChaitin Complexity for short sequences
– Jeanpaul Delahaye, Hector Zenil
 2007

1

eds) Handbook of the Philosophy of Information
– K Kelly, Ockhams Razor, Truth, in J van Behthem Information, P Adriaans
