Abstract
Organs other than the central nervous system have functions that are fairly well understood. The heart is a pump, the lung a gas exchanger, the kidney a filter. These functions had to remain mysterious to Hippocrates, Aristotle, and Galen whose times lacked an accurate chemistry, but now most of the mysteries are gone. The brain, however, is still poorly understood, as poorly as the other organs before modern physics and chemistry. The brain’s functions are not physical or chemical but cybernetic. The brain is a sensing and control organ. The theoretical framework for its functions is computer science, a discipline that has had much less time to mature than physics and chemistry, and consequently is less well developed. Understanding the brain remains a profound challenge.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Arbib, M.A.: The Metaphorical Brain, Wiley-Interscience, New York, 1972.
Ashby, W.R.: Design for a Brain, Chapman and Hall, London, 1952.
Baer, R.M. and Martinez, H.M.: Automata and biology, to appear in Ann. Rev. Of Biophy. a. Bioeng., Ann. Rev., Inc., Palo Alto, California.
Bennet, C.H.: Logical reversibility of computation, IBM Journ. Research and Developm. 17, 525–532 (1973).
Blum, M.: A machine independent theory of the complexity of recursive functions, Journ. Assoc. Comput. Mach. 14 322–336 (1967).
Bremermann, H.J.: Limitations on data processing arising from quantum theory, Part I. in, Optimization through evolution and recombination. In: Self-Organizing Systems 1962, ed. by M.C. Yovits, G.T. Jacobi, and G.D.,Goldstein, pp. 93–106. Spartan Books, Washington, D.C., 1962.
Bremermann, H.J.: Limits of genetic control, IEEE Transact. Mil. Electr. Vol. MIL-7, 200–205 (1963).
Bremermann, H.J.: Quantitative aspects of goal-seeking self-organizing systems. In Progress in Theoretical Biology, Vol. 1, ed. by M. Snell, pp. 59–77. Academic Press, New York, 1967.
Bremermann, H.J.: Quantum noise and information, Proceed. Fifth Berkeley Sympos. Math. Stat. and Prob. IV, 15–20, University of California Press, Berkeley, Calif. (1967b).
Bremermann, H.J.: What mathematics can and cannot do for pattern recognition. In: Pattern Recognition in Biological and Technical Systems, ed. by O.J. Grüsser, pp. 31–45. Springer-Verlag, Berlin, 1971.
Bremermann, H.J.: Manifolds, models, automata and computability. To appear in Journal of Math. Biology (1974).
Gottinger, H.W.: Computable organizations, representation by sequential machine theory, Memorandum ERL-M426, March 1974, Electronics Research Lab, University of California, Berkeley, Calif. (1974).
Hartmanis, J. and Hopcroft, J.E.: An overview of the theor of computational complexity, Journal Assoc. Compt. Mach. 18, 444–475 (1971).
Hartmanis, J. and Stearns, R.E.: On the computational complexity of algorithms, Trans. Amer. Math. Soc. 117, 285–306 (1965).
Kaiman, R.E., Falb, P.L. and Arbib, M.A.: Topics in Mathematical Systems Theory, McGraw-Hill, New York, 1969.
Karp, R.M.: Lecture Notes, Dept. of Computer Science, University of California, Berkeley, Calif. (1972).
Keracuba, A. and Ofman, J.: Multiplication of many-digit numbers by computer automata (Russian), Dokl. Adad. Nauk, SSSR 145, 293–294 (1962).
Keyes, R.W. and Landauer, R.: Minimal energy dissipation in logic, IBM Journ. Res. and Developm. 14 ,152–157 (1970).
Kleene, S.C.: Representations of events in nerve nets and finite automata. In: Automata Studies, ed. by C.E. Shannon and J. McCarthy. Annals of Math. Studies No. 34, Princeton University Press, Princeton, N.J. (1956)..
Kolmogorov, A.N.: On the representation of continuous functions of several variables by superposition of continuous functions of a smaller number of variables, Dokl. Akad. Nauk SSSR 108, p. 2 (1956).
Kolmogorov, A.N.: Three approaches for defining the concept of information quantity, Information Transmission 1, 3–11 (1965).
Kolmogorov, A.N.: The logical basis for information theory and probability theory, IEEE Transact. Information Theory, Vol. IT-14, 662–664 (1968).
Kolmogorov, A.N. and Tichomirov, W.M.: ε-Entropie und ε-Kapazität von Mengen in Funktionalräumen, Arbeiten zur Informationstheorie III, VEB Deutscher Verlag der Wissenschaften, Berlin (1960).
Krohn, K. and Rhodes, J.L.: Complexity of finite semigroups, Annals of Math., 88, 128–160 (1968).
Landauer, R.: Irreversibility and heat generation in the computing process, IBM Journ. Research and Developm. 5, 183–191 (1961).
McCulloch, W.S. and Pitts, W.: A logical calculus of the ideas immanent in nervous activity, Bull. Math. Biophysics, 5, 115–133 (1943).
Ostrowski, A.M.: On two problems in abstract algebra connected with Horner’s rule, Studies in Mathematics and Mechanics, pp. 40–48, Academic Press, New York (1954).
Pan, V. Ya.: Methods of computing values of polynomials, Russian Math. Surveys, 21 ,105–136 (1966).
Rhodes, J.L.: Application of automata theory and algebra via the mathematical theory of complexity, Notes, Dept. Math., University of California/Berkeley, Calif. (1971).
Schönhage, A. and Strassen, V.: Schnelle Multiplikation grosser Zahlen, Computing, 7, 281–292 (1971).
Solomonoff, R.J.: A formal theory of inductive inference, Pt. I, Inform. Control, 7, 1–22, Pt. II, ibid., 224–254 (1964).
Stearns, R.E., Hartmanis, J. and Lewis, P.M.: Hierarchies of memory limited computations, IEEE Conf. Rec. on Switching Circuit Theory and Logical Design, IEEE Pub. 16C13, 179–190 (1965).
Strassen, V.: Gaussian elimination is not optimal, Numerische Mathematik, 13 ,354–356 (1969).
Strassen, V.: Evaluation of rational functions. In: Complexity of Computer Computations, ed. by R.E. Miller, J.W. Thatcher and J.D. Bohlinger, pp. 1–10. Plenum Press, New York, 1972.
Thom, R.: Stabilité Structurelle et Morphogenese, Benjamin, Reading, Mass., 1972.
Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem, Proceed. London Math. Soc. Ser. 2, Vol. 43, 230–265 (1936).
Vitushkin, A.G.: Theory of the Transmission and Processing of Information, Pergamon Press, New York, 1961.
Von Neumann, J.: The Computer and the Brain, Yale University Press, New Haven, Conn, 1958.
Von Neumann, J. and Burks, A.W.: Theory of Self-reproducing Automata, University of Illinois Press, Urbana, I11., 1966.
Von Neumann, J. and Morgenstern, O.: Theory of Games and Economic Behavior, Princeton Press, Princeton, N.J., 1953.
Willis, D.G.: Computational complexity and probability constructions, Journ. Assoc. Comp. Mach. 17, 241–259 (1970).
Yost, J.L.: Modelling a Nerve Cell Membrane as a Finite-State Machine, M.A. thesis, Dept. Math., University of California, Berkeley, Calif (1973).
Zadeh, L.A.: Outline of a new approach to the analysis of complex systems and decision processes, IEEEE Transact. Systems, Man, Cybernetics, Vol. SMC-3, 28–44 (1973).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Bremermann, H. (1974). Complexity of Automata, Brains, and Behavior. In: Conrad, M., GĂĽttinger, W., Dal Cin, M. (eds) Physics and Mathematics of the Nervous System. Lecture Notes in Biomathematics, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80885-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-80885-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07014-6
Online ISBN: 978-3-642-80885-2
eBook Packages: Springer Book Archive