Computation Beyond the Turing Limit

@article{Siegelmann1995ComputationBT,
  title={Computation Beyond the Turing Limit},
  author={H. 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… Expand
274 Citations
Physical Hypercomputation and the Church–Turing Thesis
How much can analog and hybrid systems be proved (super-)Turing
The Enduring Legacy of the Turing Machine
On Super-Turing Neural Computation
Universal Field Machine that Computes Beyond the Turing Limit
Turing on Super-Turing and adaptivity.
  • H. Siegelmann
  • Computer Science, Medicine
  • Progress in biophysics and molecular biology
  • 2013
Computational processes, observers and Turing incompleteness
  • Klaus Sutner
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2011
The Simple Dynamics of Super Turing Theories
Quantum Principles and Mathematical Computability
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 36 REFERENCES
The Simple Dynamics of Super Turing Theories
Unpredictability and undecidability in dynamical systems.
  • Moore
  • Physics, Medicine
  • Physical review letters
  • 1990
Analog Computation via Neural Networks
Introduction to Automata Theory, Languages and Computation
Computability with Low-Dimensional Dynamical Systems
Introduction to the theory of neural computation
Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields
...
1
2
3
4
...