Limits on the computing power of biological systems
- 41 Downloads
The theory of computational complexity and certain explicitly-stated hypotheses imply limitations on the information processing power of biological systems. Parallelism, special purpose organization, and analog mechanisms may provide speedup critical for life processes, but have little power in the face of exponential growth. We show that “polynomially simulatable” biological systems cannot exhibit dynamic behavior which produces the solution of an intractable problem. The argument implies that parallelism does not allow biological systems to defeat the exponential explosion, but rather is important because it allows polynomial time algorithms to be used more efficiently.
KeywordsBiological System Free Energy Problem Instance Simulation Program Digital Computer
Unable to display preview. Download preview PDF.
- Arbib, M. 1974.The Metaphorical Brain. New York: Wiley-Interscience.Google Scholar
- Bremermann, H. J. 1962. “Limitations on Data Processing Arising from Quantum Theory”, part I of “Optimization through Evolution and Recombination”, InSelf-Organizing Systems, Ed. M. C. Yovits G. T. Jacobi, and G. D. Goldstein, pp. 93–106. Washington, D.C.: Spartan Books.Google Scholar
- Bremermann, H. J. 1974. “Complexity of Automata, Brains, and Behavior.” InPhysics and Mathematics of the Nervous System. Eds M. Conrad, W. Guttinger, and M. Dal Cin, pp. 304–331. Heidelberg: Springer.Google Scholar
- Garey, M. and D. Johnson. 1979.Computers and Intractability. New York: Freeman.Google Scholar
- Meyer, A. 1975. “Weak Monadic Second Order Theory of Successor Is Not Elementary Recursive.” InLogic Colloquium, Ed. R. Parikh, pp. 132–154. Berlin: Springer.Google Scholar
- Rössler, O. 1974 “Adequate Locomotion Strategies for an Abstract Organism in an Abstract Environment. A Relational Approach, to Brain Function.” InPhysics and Mathematics of the Nervous System, Eds M. Conrad, W. Guttinger, and M. Dal Cin, pp. 342–369. Heidelberg Springer.Google Scholar