Transcending Turing Computability

Author: Maclennan, B.J.

Source: Minds and Machines, Volume 13, Number 1, February 2003 , pp. 3-22(20)

Publisher: Springer

Buy & download fulltext article:

OR

Price: $47.00 plus tax (Refund Policy)

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.

Keywords: Turing machine; analog computation; analog computer; biocomputation; computability; continuous computation; hypercomputation; natural computation

Document Type: Research Article

Affiliations: Department of Computer Science, University of Tennessee, Knoxville, TN, USA; E-mail: maclennan@cs.utk.edu

Publication date: February 1, 2003

Related content

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page