Skip to main content
Log in

Transcending Turing Computability

  • Published:
Minds and Machines Aims and scope Submit manuscript

Abstract

It has been argued that neural networks and other forms of analog computation may transcend the limits of Turing-machine computation; proofs have been offered on both sides, subject to differing assumptions. In this article I argue that the important comparisons between the two models of computation are not so much mathematical as epistemological. The Turing-machine model makes assumptions about information representation and processing that are badly matched to the realities of natural computation (information representation and processing in or inspired by natural systems). This points to the need for new models of computation addressing issues orthogonal to those that have occupied the traditional theory of computation.

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.

Institutional subscriptions

Similar content being viewed by others

References

  • Ballard, D.H. (1997), An Introduction to Natural Computation, Cambridge, MA: MIT Press.

    Google Scholar 

  • Blum, L., Shub, M. and Smale, S. (1988), 'On a Theory of Computation and Complexity over the Real Numbers: NP Completeness, Recursive Functions and Universal Machines', The Bulletin of the American Mathematical Society 21, pp. 1–46.

    Google Scholar 

  • Copeland, B.J. (1997), 'Vague Identity and Fuzzy Logic', The Journal of Philosophy 94, pp. 514–534.

    Google Scholar 

  • Copeland, B.J. (2000), 'Narrow Versus Wide Mechanism', The Journal of Philosophy 97, pp. 5–32.

    Google Scholar 

  • Copeland, B.J. and Proudfoot, D. (1999), 'Alan Turing's Forgotten Ideas in Computer Science', Scientific American 280(4), pp. 77–81.

    Google Scholar 

  • Dreyfus, H.L. (1979), What Computers Can't Do: The Limits of Artificial Intelligence, NewYork, NY: Harper & Row, revised edition.

    Google Scholar 

  • Gandy, R. (1980), 'Church's Thesis and Principles for Mechanisms' in J. Barwise, H.J. Keisler and K. Kunen, eds., The Kleene Symposium, Amsterdam, The Netherlands: North-Holland, pp. 123–148.

    Google Scholar 

  • Goodman, N. (1968), Languages of Art: An Approach to a Theory of Symbols, Indianapolis, IN and New York, NY: Bobbs-Merrill.

    Google Scholar 

  • Lakoff, G. and Johnson, M. (1999), Philosophy in the Flesh: The Embodied Mind and Its Challenge to Western Thought, New York, NY: Basic Books.

    Google Scholar 

  • Maass, W. and Sontag, E.D. (1999), 'Analog Neural Nets with Gaussian or Other Common Noise Distributions Cannot Recognize Arbitrary Regular Languages', Neural Computation 11(3), pp. 771–782.

    Google Scholar 

  • MacLennan, B.J. (1987), 'Technology-Independent Design of Neurocomputers: The Universal Field Computer' in M. Caudill and C. Butler, eds., Proceedings of the IEEE First International Conference on Neural Networks, Vol. 3, IEEE Press, pp. 39–49.

  • MacLennan, B.J. (1988), 'Logic for the New AI' in J.H. Fetzer, ed., Aspects of Artificial Intelligence, Dordrecht, The Netherlands: Kluwer Academic Publishers, pp. 163–192.

    Google Scholar 

  • MacLennan, B.J. (1990a), 'The Discomforts of Dualism', Behavioral and Brain Sciences 13, pp. 673–674. Also available from www.cs.utk.edu/~mclennan.

    Google Scholar 

  • MacLennan, B.J. (1990b), 'Field Computation: A Theoretical Framework for Massively Parallel Analog Computation, Parts I- IV', Technical Report CS-90- 100, Department of Computer Science, University of Tennessee, Knoxville. Also available from www.cs.utk.edu/~mclennan.

    Google Scholar 

  • MacLennan, B.J. (1991), 'Gabor Representations of Spatiotemporal Visual Images', Technical Report CS-91- 144, Department of Computer Science, University of Tennessee, Knoxville. Also available from www.cs.utk.edu/~mclennan.

    Google Scholar 

  • MacLennan, B.J. (1993a), 'Characteristics of Connectionist Knowledge Representation', Information Sciences 70, pp. 119–143. Also available from www.cs.utk.edu/~mclennan.

    Google Scholar 

  • MacLennan, B.J. (1993b), 'Field Computation in the Brain' in K. Pribram, ed., Rethinking Neural Networks: Quantum Fields and Biological Data, Hillsdale, NJ: Lawrence Erlbaum, pp. 199–232. Also available from www.cs.utk.edu/~mclennan.

    Google Scholar 

  • MacLennan, B.J. (1993c), 'Grounding Analog Computers', Think 2, pp. 48–51. Also available from www.cs.utk.edu/~mclennan and at cogprints.soton.ac.uk/abs/comp/199906003.

    Google Scholar 

  • MacLennan, B.J. (1993d), 'Information Processing in the Dendritic Net' in K.H. Pribram, ed., Rethinking Neural Networks: Quantum Fields and Biological Data, Hillsdale, NJ: Lawrence Erlbaum, pp. 161–197. Also available from www.cs.utk.edu/~mclennan.

    Google Scholar 

  • MacLennan, B.J. (1994a), 'Continuous Computation and the Emergence of the Discrete' in K.H. Pribram, ed., Origins: Brain & Self-Organization, Hillsdale, NJ: Lawrence Erlbaum, pp. 121–151. Also available from www.cs.utk.edu/~mclennan and at cogprints. soton.ac.uk/abs/comp/199906001.

    Google Scholar 

  • MacLennan, B.J. (1994b), 'Continuous Symbol Systems: The Logic of Connectionism' in D.S. Levine and M. Aparicio IV, eds., Neural Networks for Knowledge Representation and Inference, Hillsdale, NJ: Lawrence Erlbaum, pp. 83–120. Also available from www.cs.utk.edu/~mclennan.

    Google Scholar 

  • MacLennan, B.J. (1994c), 'Image and Symbol: Continuous Computation and the Emergence of the Discrete', in V. Honavar & L. Uhr, eds., Artificial Intelligence and Neural Networks: Steps Toward Principled Integration, Volume I: Basic Paradigms; Learning Representational Issues; and Integrated Architectures, New York, NY: Academic Press, pp. 207–240.

    Google Scholar 

  • MacLennan, B.J. (1994d), 'Words Lie in our Way', Minds and Machines 4(4), pp. 421–437. Also available from www.cs.utk.edu/~mclennan and at cogprints.soton.ac.uk/abs/phil/199906001.

    Google Scholar 

  • MacLennan, B.J. (1995), 'Continuous Formal Systems: A Unifying Model in Language and Cognition' in Proceedings of the IEEE Workshop on Architectures for Semiotic Modeling and Situation Analysis in Large Complex Systems, Monterey, CA, pp. 161–172. Also available from www.cs.utk.edu/~mclennan and at cogprints.soton.ac.uk/abs/comp/199906002.

  • MacLennan, B.J. (1997), 'Field Computation in Motor Control' in P.G. Morasso and V. Sanguineti, eds., Self-Organization, Computational Maps and Motor Control, Amsterdam, The Netherlands: Elsevier, pp. 37–73. Also available from www.cs.utk.edu/~mclennan.

    Google Scholar 

  • MacLennan, B.J. (1999), 'Field Computation in Natural and Artificial Intelligence', Information Sciences 119, pp. 73–89. Also available from www.cs.utk.edu/~mclennan.

    Google Scholar 

  • MacLennan, B.J. (2001), 'Can Differential Equations Compute?', Technical Report UT-CS–01–459, Department of Computer Science, University of Tennessee, Knoxville. Also available from www.cs.utk.edu/~mclennan.

    Google Scholar 

  • Markov, A.A. (1961), Theory of Algorithms, Jerusalem, Israel: Israel Program for Scientific Translation. US Dept. of Commerce Office of Technical Service OTS 60–51085, transl. by Jacques J. Schorr-Kon and PST Staff. Translation of Teoriya Algorifmov, Moscow, USSR: Academy of Sciences of the USSR, 1954.

    Google Scholar 

  • Parkinson, L.L. (1966), Leibniz Logical Papers: A Selection, Oxford, UK: Oxford University Press.

    Google Scholar 

  • Penrose, R. (1989), The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics, Oxford, UK: Oxford University Press.

    Google Scholar 

  • Penrose, R. (1990), 'Précis of: The Emperor's New Mind', Behavioral and Brain Sciences 13, pp. 643–705.

    Google Scholar 

  • Pour-El, M.B. (1974), 'Abstract Computability and its Relation to The General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)', Transactions of the American Mathematical Society 199, pp. 1–29.

    Google Scholar 

  • Rubel, L.A. (1981), 'A Universal Differential Equation', Bulletin (New Series) of the American Mathematical Society 4(3), pp. 345–349.

    Google Scholar 

  • Rubel, L.A. (1993), 'The Extended Analog Computer', Advances in Applied Mathematics 14, pp. 39–50.

    Google Scholar 

  • Rumelhart, D.E., McClelland, J.L. and the PDP Research Group (1986), Parallel Distributed Processing: Explorations in the Microstructure of Cognition, Cambridge, MA: MIT Press.

    Google Scholar 

  • Shannon, C.E. (1941), 'Mathematical Theory of the Differential Analyzer', Journal of Mathematics and Physics of the Massachusetts Institute of Technology 20, pp. 337–354.

    Google Scholar 

  • Simon, H.A. (1969), The Sciences of the Artificial, Cambridge, MA: MIT Press.

    Google Scholar 

  • Tarski, A. (1936), 'Der Wahrheitsbegriff in den formalisierten Sprachen', Studia Philosophica 1, pp. 261–405.

    Google Scholar 

  • Turing, A.M. (1936), 'On Computable Numbers, with an Application to the Entscheidungsproblem', Proceedings of the London Mathematical Society, Series 2, 42 (1936- 37), pp. 230–265; corrections, ibid., 43 (1937), pp. 544- 546.

    Google Scholar 

  • A.M. (1950), 'Computing Machinery and Intelligence', Mind 59, pp. 433–460.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maclennan, B. Transcending Turing Computability. Minds and Machines 13, 3–22 (2003). https://doi.org/10.1023/A:1021397712328

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021397712328

Navigation