# Computation Beyond the Turing Limit

@article{Siegelmann1995ComputationBT, title={Computation Beyond the Turing Limit}, author={Hava T. Siegelmann}, journal={Science}, year={1995}, volume={268}, pages={545 - 548} }

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…

## 289 Citations

### Physical Hypercomputation and the Church–Turing Thesis

- PhilosophyMinds and Machines
- 2004

It is argued that the existence of the device does not refute the Church–Turing thesis, but nevertheless may be a counterexample to Gandy's thesis.

### How much can analog and hybrid systems be proved (super-)Turing

- Computer ScienceAppl. Math. Comput.
- 2006

### The Enduring Legacy of the Turing Machine

- Computer ScienceComput. J.
- 2012

The Church-Turing thesis has stood the test of time, capturing computation models Turing could not have conceived of, including digital computation, probabilistic, parallel and quantum computers and…

### Recurrent Neural Networks - A Natural Model of Computation beyond the Turing Limits

- Computer ScienceIJCCI
- 2012

It is shown that recurrent neural networks provide a suitable and natural model of computation beyond the Turing limits, and doesn’t draw any hasty conclusion about the controversial issue of a possible predominance of biological intelligence over the potentialities of artificial intelligence.

### On Super-Turing Neural Computation

- Computer Science
- 2015

A historical survey of the most significant results concerning the computational power of neural models, and the recent results by Cabessa, Siegelmann and Villa revealing the super-Turing computational potentialities of interactive and evolving recurrent neural networks.

### Turing on Super-Turing and adaptivity.

- Biology, Computer ScienceProgress in biophysics and molecular biology
- 2013

### Universal Field Machine that Computes Beyond the Turing Limit

- Computer ScienceComplex Syst.
- 2000

A model of an idealized machine is proposed that makes use of various “physical” fields to perform computations and has the important advantage of being programmable, and it is possible for a hypothetical operator of such a machine to know which problem the machine solves.

### Computational processes, observers and Turing incompleteness

- Mathematics, Computer ScienceTheor. Comput. Sci.
- 2011

### Quantum Principles and Mathematical Computability

- Physics
- 2002

Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique…

## References

SHOWING 1-10 OF 30 REFERENCES

### Analog computation via neural networks

- Computer Science[1993] The 2nd Israel Symposium on Theory and Computing Systems
- 1993

The authors pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research, which exhibit at least some robustness with respect to noise and implementation errors.

### Unpredictability and undecidability in dynamical systems.

- PhysicsPhysical review letters
- 1990

It is shown that motion with as few as three degrees of freedom can be equivalent to a Turing machine, and so be capable of universal computation.

### Introduction to Automata Theory, Languages and Computation

- Computer Science
- 1979

### Computability with Low-Dimensional Dynamical Systems

- Computer Science, MathematicsTheor. Comput. Sci.
- 1994

### Optical realization of the baker's transformation

- Physics
- 1994

The quantization of a completely chaotic system-the baker's transformation-is investigated using the fact that the relationship between classical and quantum mechanics is directly analogous to the…

### Introduction to the theory of neural computation

- Computer ScienceThe advanced book program
- 1991

This book is a detailed, logically-developed treatment that covers the theory and uses of collective computational networks, including associative memory, feed forward networks, and unsupervised learning.

### Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields

- MathematicsApplied Mathematical Sciences
- 1983

Contents: Introduction: Differential Equations and Dynamical Systems.- An Introduction to Chaos: Four Examples.- Local Bifurcations.- Averaging and Perturbation from a Geometric Viewpoint.-…

### Computers and Intractability: A Guide to the Theory of NP-Completeness

- Computer Science
- 1978

The experiences, understandings, and beliefs that guide the professional practices of teacher educators are explored, and the book paints a picture of a profession that offers huge rewards, alongside challenges and frustrations.

### Dating and context of three middle stone age sites with bone points in the Upper Semliki Valley, Zaire.

- GeologyScience
- 1995

In eastern Zaire, archaeological sites with bone points have yielded dates older than 89(-15)+22 thousand years ago by several techniques, which are consistent with this age.