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

Author: Edis T.¹

Source: Minds and Machines, Volume 8, Number 2, 1998 , pp. 251-262(12)

Publisher: Springer

Key:

- Free Content

- New Content

- Subscribed Content

- Free Trial Content

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.

Keywords: human nonalgorithmicity; Gödel's Theorem; randomized computation; randomness

Language: English

Document Type: Regular paper

Affiliations: 1: Department of Physics, Southern University and A & M College, Baton Rouge LA 70813, U.S.A.

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$47.00 plus tax Refund Policy