Advertisement

The bulletin of mathematical biophysics

, Volume 24, Issue 4, pp 375–393 | Cite as

Church’s thesis and its relation to the concept of realizability in biology and physics

  • Robert Rosen
Article

Abstract

An attempt to characterize the physical realizability of an abstract mapping process in terms of the Turing computability of an associated numerical function is described. Such an approach rests heavily on the validity of Church’s Thesis for physical systems capable of computing numerical functions. This means in effect that one must investigate in what manner Church’s Thesis can be converted into an assertion concerning the nonexistence of a certain class of physical processes (namely, those processes which are capable of calculating the values of numerical functions which are not Turing-computable). A formulation which may be plausible is suggested, and it is then shown that the truth of Church’s Thesis in this, form is closely connected with the “effectiveness” of theoretical descriptions of physical systems. It is shown that the falsity of this form of Church’s Thesis is related to a fundamental incompleteness in the possibility of describing physical systems, much like the incompleteness which Gödel showed to be inherent in axiomatizations of elementary arithmetic. Various implications of these matters are briefly discussed.

Keywords

Physical System Turing Machine Physical Entity Numerical Function Elementary Input 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. Bohm, D., 1957.Causality and Chance in Modern Physics. London: Routledge & Kegan Paul Ltd.Google Scholar
  2. Bremermann, H. J. 1962. “Optimization Through Evolution and Recombination.” InSelf-Organizing Systems, M. Yovits, G. T. Jacobi, and G. D. Goldstein, eds. Washington: Spartan Books.Google Scholar
  3. Church, A. 1936. “An Unsolvable Problem of Elementary Number Theory.”Am. J. Math.,21, 275–281.MathSciNetGoogle Scholar
  4. Davis, M. 1958.Computability and Unsolvability. New York: McGraw-Hill Book Co.zbMATHGoogle Scholar
  5. Joos, G. 1950.Theoretical Physics. New York: Hafner Publishing Co.zbMATHGoogle Scholar
  6. Kleene, S. C. 1952.Introduction to Metamathematics. New York: D. Van Nostrand Co., Inc.Google Scholar
  7. von Neumann, J. 1950.Mathematical Foundations of Quantum Mechanics. Princeton: Princeton University Press.zbMATHGoogle Scholar
  8. Rashevsky, N. 1954. “Topology and Life.”Bull. Math. Biophysics,16, 317–348.MathSciNetGoogle Scholar
  9. Riemann, B. 1892. “Uber die Hypothesen, Welche der Geometrie zu Grunde Liegen.” Mathematische Werke (2 Aufl., Nr. XIII, p. 272). Leipzig.Google Scholar
  10. Rosen, R. 1958a. “A Relational Theory of Biological Systems.”Bull. Math. Biophysics,20, 245–260.CrossRefGoogle Scholar
  11. — 1958b. “The Representation of Biological Systems from the Standpoint of the Theory of Categories.”Ibid.,20, 317–341.CrossRefGoogle Scholar
  12. — 1959. “A Relational Theory of Biological Systems II.”Ibid.,21, 109–128.CrossRefGoogle Scholar
  13. — 1961. “Recent Progress in Relational Biology.” InProceedings of the Cullowhee Conference on Training in Biomathematics. Raleigh: North Carolina State College (to appear).Google Scholar
  14. — 1962. “A Note on Abstract Relational Biologies.”Bull. Math. Biophysics,24, 31–38.zbMATHGoogle Scholar
  15. Turing, A. M. 1937. “On Computable Numbers.”Proc. London Math. Soc.,42, 230–265.Google Scholar

Copyright information

© University of Chicago 1962

Authors and Affiliations

  • Robert Rosen
    • 1
  1. 1.Committee on Mathematical BiologyThe University of ChicagoChicagoUSA

Personalised recommendations