Skip to main content
Log in

Example of a system which is computation universal but not effectively programmable

  • Note
  • Published:
Bulletin of Mathematical Biology Aims and scope Submit manuscript

Abstract

The incorporation of a chaotic component in a computing system is incompatible with its being effectively programmable. The example presented shows that concepts of programming suitable for biological systems may differ from those which have grown out of our experience with present day digital computers.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Literature

  • Conrad, M. 1974. “The Limits of Biological Simulation”.J. theor. Biol. 45, 585–590.

    Article  Google Scholar 

  • —, 1979. “Bootstrapping on the Adaptive Landscape”.Biosystems 11, 167–182.

    Article  Google Scholar 

  • — and A. Rosenthal. 1980. “Limits on the Computing Power of Biological Systems”.Bull. math. Biol. 43, 59–67.

    Article  MathSciNet  Google Scholar 

  • Guckenheimer, J. 1980. “A Brief Introduction to Dynamical Systems”. InNonlinear Oscillations in Biology, Ed. F. C. Hoppensteadt, pp. 187–253. Lectures in Applied Mathematics. 17. Providence R. I.: American Math. Soc.

    Google Scholar 

  • Lorenz, E. 1963. “Deterministic Nonperiodic Flow”.J. Atmos. Sci. 20, 130–141.

    Article  Google Scholar 

  • Rössler, O. 1979. Chaos and Strange Attractors in Chemical Kinetics”. InSynthetics—Far from Equilibrium, Ed. A. Pacault and C. Vidal, pp. 107–113. Heidelberg: Springer.

    Google Scholar 

  • Shaw, R. 1981. “Strange Attractors, Chaotic Behavior, and Information Flow”.Z. Naturforsch. 36, 80–112.

    MATH  MathSciNet  Google Scholar 

  • Smale, S. 1967. “Differentiable Dynamical Systems”.Bull. am. Math. Soc. 73, 747–817.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Conrad, M., Rössler, O. Example of a system which is computation universal but not effectively programmable. Bltn Mathcal Biology 44, 443–447 (1982). https://doi.org/10.1007/BF02462291

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02462291

Keywords

Navigation