Computation Beyond the Turing Limit
- 28 April 1995
- journal article
- other
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 268 (5210), 545-548
- https://doi.org/10.1126/science.268.5210.545
Abstract
Extensive efforts 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 beyond the Turing limit (super-Turing); it computes exactly like neural networks and analog machines. This dynamical system is conjectured to describe natural physical phenomena.Keywords
This publication has 14 references indexed in Scilit:
- On the Computational Power of Neural NetsJournal of Computer and System Sciences, 1995
- Welcoming the super Turing theoriesLecture Notes in Computer Science, 1995
- Computability with low-dimensional dynamical systemsTheoretical Computer Science, 1994
- Analog computation via neural networksTheoretical Computer Science, 1994
- Optical realization of the baker's transformationNonlinearity, 1994
- Generalized shifts: unpredictability and undecidability in dynamical systemsNonlinearity, 1991
- Unpredictability and undecidability in dynamical systemsPhysical Review Letters, 1990
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- IntroductionPublished by Springer Nature ,1988
- A logical calculus of the ideas immanent in nervous activityBulletin of Mathematical Biology, 1943