TO A MATHEMATICAL DEFINITION OF “ LIFE ”

“Life” and its “evolution” are fundamental concepts that have not yet been formulated in precise mathematical terms, although some efforts in this direction have been made. We suggest a possible point of departure for a mathematical definition of “life.” This definition is based on the computer and is closely related to recent analyses of “inductive inference” and “randomness.” A living being is a unity; it is simpler to view a living organism as a whole than as the sum of its parts. If we want to compute a complete description of the region of space-time that is a living being, the program will be smaller in size if the calculation is done all together, than if it is done by independently calculating descriptions of parts of the region and then putting them together.

[1]  Donald W. Loveland,et al.  A Variant of the Kolmogorov Concept of Complexity , 1969, Information and Control.

[2]  Gregory J. Chaitin,et al.  On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers , 1969, J. ACM.

[3]  Donald W. Loveland,et al.  On minimal-program complexity measures , 1969, STOC.

[4]  Per Martin-Löf,et al.  The Definition of Random Sequences , 1966, Inf. Control..

[5]  Andrei N. Kolmogorov,et al.  Logical basis for information theory and probability theory , 1968, IEEE Trans. Inf. Theory.

[6]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..

[7]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

[8]  Michael A. Arbib,et al.  Automata theory and development: Part I , 1967 .

[9]  David G. Willis,et al.  Computational Complexity and Probability Constructions , 1970, JACM.

[10]  E. F. Moore.  Machine Models of Self-Reproduction , 1962 .

[11]  Marvin Minsky,et al.  PROBLEMS OF FORMULATION FOR ARTIFICIAL INTELLIGENCE , 1962 .

[12]  J ChaitinGregory.  On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers , 1969 .

[13]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences: statistical considerations , 1969, JACM.

[14]  Gregory J. Chaitin,et al.  On the difficulty of computations , 1970, IEEE Trans. Inf. Theory.

[15]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .