Transcending Turing Computability (2001)
| Venue: | Minds and Machines |
| Citations: | 12 - 9 self |
BibTeX
@INPROCEEDINGS{Maclennan01transcendingturing,
author = {Bruce J. Maclennan},
title = {Transcending Turing Computability},
booktitle = {Minds and Machines},
year = {2001},
pages = {3--22}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
It has been argued that neural networks and other forms of analog computation may transcend the limits of Turing computation; proofs have been oered on both sides, subject to diering assumptions. In this report 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: computability, Turing machine, hypercomputation, natural computation, biocomputation, analog computer, analog computation, continuous computation 1.
