Information-Theoretic Computational Complexity Invited Paper

  title={Information-Theoretic Computational Complexity Invited Paper},
  author={Gregory J. Chaitin},
This paper attempts to describe, in nontechnical language, some of the concepts and methods of one school of thought regarding computational complexity. It applies the viewpoint of information theory to computers. This will first lead us to a definition of the degree of randomness of individual binary strings, and then to an information-theoretic version of Gödel's theorem on the limitations of the axiomatic method. Finally, we will examine in the light of these ideas the scientific method and… CONTINUE READING


Publications citing this paper.


Publications referenced by this paper.
Showing 1-9 of 9 references

From Frege to Gödel: A Source Book in Mathematical Logic, 18791931

J. van Heijenoort, Ed
View 10 Excerpts
Highly Influenced

Reeker, ``Artificial intelligence---a case for agnosticism,'' Ohio State University, Columbus, Ohio, Rep. OSU-CISRC-TR-72-9, Aug

L.H.B. Chandrasekaran
IEEE Trans. Syst., Man, Cybern., vol • 1974
View 2 Excerpts

On the difficulty of computations

IEEE Trans. Information Theory • 1970
View 2 Excerpts

Logical basis for information theory and probability theory

IEEE Trans. Information Theory • 1968
View 1 Excerpt

Edited and Pagina 9 di 10 Information-Theoretic Computational Complexity 20/04/2004

A. W. Burks
Theory of Self-Reproducing Automata. Urbana, Ill.: Univ. Illinois Press, • 1966
View 1 Excerpt

Kolmogorov , ` ` Logical basis for information theory and probability theory

N. A.
Inform . Theory • 1964

Solomonoff, ``A formal theory of inductive inference,'

R J.
Inform. Contr., • 1964
View 2 Excerpts

Statistical Independence in Probability, Analysis, and Number Theory, Carus Math. Mono

M. Kac
Mathematical Association of America, • 1959

Similar Papers

Loading similar papers…