Computation Beyond the Turing Limit

  • Siegelmann H
N/ACitations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Extensiveefforts have been made to prove the Church-Turing thesis, which suggests that all realizable dynamical and physical systems cannot be more powerful than classical models of computation. A simply described but highly chaotic dynamical system called the analog shift map is presented here,which has computational power beyondthe Turing limit (super-Turing); it computes exactly like neural networks and analog machines. This dynamical system is conjectured to describe natural physical phenomena.

Cite

CITATION STYLE

APA

Siegelmann, H. T. (1999). Computation Beyond the Turing Limit. In Neural Networks and Analog Computation (pp. 153–164). Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-0707-8_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free