skip to main content
article
Free Access

To a mathematical definition of 'life'

Published:01 January 1970Publication History
Skip Abstract Section

Abstract

'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 a 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.

References

  1. Arbib, M. A. (1966). 'Simple self-reproducing universal automata,' Information and Control.Google ScholarGoogle Scholar
  2. Arbib, M. A. (1967). 'Automata theory and development: Part 1,' Journal of Theoretical Biology.Google ScholarGoogle ScholarCross RefCross Ref
  3. Arbib, M. A. 'Self-reproducing automata--some implications for theoretical biology'.Google ScholarGoogle Scholar
  4. Biological Sciences Curriculum Study. (1968). Biological Science: Molecules to Man, Houghton Miffl in Co.Google ScholarGoogle Scholar
  5. Chaitin, G. J. (1966). 'On the length of programs for computing finite binary sequencest,' Journal of the Association for Computing Machinery.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Chaitin, G. J. (1969a). 'On the length of programs for computing finite binary sequencest: Statistical considerations,' ibid.Google ScholarGoogle Scholar
  7. Chaitin, G. J. (1969b). 'On the simplicity and speed of programs for computing infinite sets of natural numbers,' ibid.Google ScholarGoogle Scholar
  8. Chaitin, G. J. (1970). 'On the difficulty of computations,' IEEE Transactions on Information Theory.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Codd, E. F. (1968). Cellular Automata. Academic Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Kolmogorov, A. N. (1965). 'Three approaches to the definition of the concept 'amount of information' ', Problemy Peredach i Informatsii.Google ScholarGoogle Scholar
  11. Kolmogorov, A. N. (1968). 'Logical basis for information theory and probability theory,' IEEE Transactions on Information Theory.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Loveland, D. W. 'A variant of the Kolmogorov concept of complexity,' report 69-4, Math. Dept., Carnegie-Mellon University.Google ScholarGoogle Scholar
  13. Loveland, D. W. (1965). 'On minimal program complexity measures,' Conference Record of the ACM Symposium on Theory of Computing, May 1969. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Martin-Lof, P. (1966). 'The definition of random sequences,' Information and Control.Google ScholarGoogle Scholar
  15. Minsky, M. L. (1962). 'Problems of formulation for artificial intelligence,' Mathematical Problems in the Biological Sciences, American Math. Society.Google ScholarGoogle Scholar
  16. Moore, E. F. (1962). 'Machine models of self-reproduction,' ibid.Google ScholarGoogle Scholar
  17. Von Neumann, J. (1966). Theory of Self-Reproducing Automata. (Edited by A. W. Burks) University of Illinois Press.Google ScholarGoogle Scholar
  18. Solomonoff, R. J. (1964). 'A formal theory of inductive inference,' Information and Control.Google ScholarGoogle Scholar
  19. Willis, D. G. (1969). 'Computational complexity and probability constructions,' Stanford UniversityGoogle ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGACT News
    ACM SIGACT News Just Accepted
    January 1970
    17 pages
    ISSN:0163-5700
    DOI:10.1145/1247047
    Issue’s Table of Contents

    Copyright © 1970 Author

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 January 1970

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader