Is wave propagation computable or can wave computers beat the turing machine?

Proceedings of the London Mathematical Society

Volumn 85, Issue 2, 2002, Pages 312-332

  Weihrauch, Klaus ^a   Zhong, Ning ^b  

^a UNIVERSITY OF HAGEN   (Germany)

^b UNIVERSITY OF CINCINNATI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036727286     PISSN: 00246115     EISSN: None     Source Type: Journal    
DOI: 10.1112/S0024611502013643     Document Type: Conference Paper

References (20)

1. Computable invariance
2. Computability of solutions of the Korteweg-de Vries equation
3. Computability and physical theories
4. Computable functionals
5. Theory of representations
6. A recursive function defined on a compact interval and having a continuous derivative that is not recursive
7. The wave equation with computable initial data whose unique solution is nowhere computable
8. Computability in analysis and physics
9. Computability and noncomputability in classical analysis
10. Concrete models of computation for topological algebras
11. The Church-Turing thesis as a guiding principle for physics
12. Information-based complexity
13. On computable numbers, with an application to the "Entscheidungsproblem"
14. The wave propagator is Turing computable
15. The wave propagator is Turing computable
16. Is the linear Schrödinger propagator Turing computable?
17. Turing computability of a nonlinear Schrödinger propagator