Abstract

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 von Neumann's views on the basic conceptual problems of biology. This field's fundamental concept is the complexity of a binary string, that is, a string of bits, of zeros and ones. The complexity of a binary string is the minimum quantity of information needed to define the string. For example, the string of length n consisting entirely of ones is of complexity approximately log 2 n, because only log 2 n bits of information are required to specify n in binary notation. However, this is rather vague. Exactly what is meant by the definition of a string? To make this idea precise a computer is used. One says that a string defines another when the first string gives instructions for constructing the second string. In other words, one string defines another when it is a

Citations

714	Theory of recursive functions and effective computability, McGraw-Hill - Rogers - 1967
689	O: Theory of games and economic behavior - Neumann, Morgenstern - 1947
316	A formal theory of inductive inference - Solomonoff - 1964
180	Self-organization of matter and the evolution of biological macromolecules - Eigen - 1971
73	Logical basis for information theory and probability theory - Kolmogorov - 1968
42	From Frege to Godel: A Source Book - Heijenoort, ed - 1967
16	On the difficulty of computations - Chaitin - 1970
2	The Undecidable---Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions - Davis - 1965
1	a mathematical definition of `life - ``To - 1970
1	Statistical Independence in Probability, Analysis - Kac - 1959
1	Artificial intelligence---a case for agnosticism - Chandrasekaran, Reeker - 1972