Transcending Turing computability

Minds and Machines 13 (1):3-22 (2003)
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 Computation  Information  Logic  Representation  Turing Machines
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1021397712328
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 33,657
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total downloads
85 ( #72,169 of 2,261,320 )

Recent downloads (6 months)
4 ( #105,327 of 2,261,320 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature