Skip to main content
Log in

How Gödel's Theorem Supports the Possibility of Machine Intelligence

  • Published:
Minds and Machines Aims and scope Submit manuscript

Abstract

Gödel's Theorem is often used in arguments against machine intelligence, suggesting humans are not bound by the rules of any formal system. However, Gödelian arguments can be used to support AI, provided we extend our notion of computation to include devices incorporating random number generators. A complete description scheme can be given for integer functions, by which nonalgorithmic functions are shown to be partly random. Not being restricted to algorithms can be accounted for by the availability of an arbitrary random function. Humans, then, might not be rule-bound, but Gödelian arguments also suggest how the relevant sort of nonalgorithmicity may be trivially made available to machines.

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

References

  • Angluin, D., and C.H. Smith. (1987) ‘Inductive Inference’, in S. Shapiro (ed.,) Encyclopedia of Artificial Intelligence, Vol. 1, New York, NY: Wiley, pp. 409–418.

    Google Scholar 

  • Berger, J.O. (1980) Statistical Decision Theory, New York, NY: Springer Verlag.

    Google Scholar 

  • Chaitin, G.J. (1987) Algorithmic Information Theory, Cambridge, UK: Cambridge University Press.

    Google Scholar 

  • Churchland, P.M. (1988) Matter and Consciousness (revised ed.), Cambridge, MA: MIT Press.

    Google Scholar 

  • Cleland, C.E. (1993) ‘Is the Church-Turing Thesis True?’, Minds and Machines, 3, pp. 283–312.

    Google Scholar 

  • Dennett, D.C. (1972), Review of J.R. Lucas, The Freedom of The Will, in Journal of Philosophy, 69, pp. 527–531.

    Google Scholar 

  • Dennett, D.C. (1995), Darwin's Dangerous Idea, New York, NY: Simon and Schuster.

    Google Scholar 

  • Fredkin, E. (1990) ‘Digital Mechanics’, Physica D 45, pp. 254–270.

    Google Scholar 

  • Grush, R. and P.S. Churchland. (1995) ‘Gaps in Penrose's Toilings’, Journal of Consciousness Studies, 2, pp. 10–29.

    Google Scholar 

  • Hodgson, D. (1991), The Mind Matters, Oxford, UK: Clarendon Press.

    Google Scholar 

  • Karpinski, M. and R. Verbeek. (1996), ‘On Randomized versus Deterministic Computation’, Theoretical Computer Science, 154, pp. 23–39.

    Google Scholar 

  • Lucas, J.R. (1961), ‘Minds, Machines, and Gödel’, Philosophy, 36, pp. 112–127.

    Google Scholar 

  • Ludwig, K. (1995), ‘Why the Difference Between Quantum and Classical Physics is Irrelevant to the Mind/Body Problem’, Psyche, 2, p.16.

    Google Scholar 

  • Mulhauser, G.R. (1995) ‘Materialism and the “Problem” of Quantum Measurement’, Minds and Machines, 5, pp. 207–217.

    Google Scholar 

  • Penrose, R. (1989), The Emperor's New Mind, Oxford, UK: Oxford University Press.

    Google Scholar 

  • Penrose, R. (1990) ‘The Nonalgorithmic Mind’, Behavioral and Brain Sciences, 13, pp. 692–705.

    Google Scholar 

  • Penrose, R. (1994) Shadows of the Mind, Oxford, UK: Oxford University Press.

    Google Scholar 

  • Stenger, V.J. (1995), The Unconscious Quantum, Buffalo, NY: Prometheus.

    Google Scholar 

  • Thagard, P. (1988), Computational Philosophy of Science, Cambridge, MA: The MIT Press.

    Google Scholar 

  • Wang, H. (1987), Reflections on Kurt Gödel, Cambridge, MA: MIT Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Edis, T. How Gödel's Theorem Supports the Possibility of Machine Intelligence. Minds and Machines 8, 251–262 (1998). https://doi.org/10.1023/A:1008233720449

Download citation

  • Issue Date:

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

Navigation