Complexity theory of real functions
Complexity theory of real functions
Computable analysis: an introduction
Computable analysis: an introduction
The Wave Propagator Is Turing Computable
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Hi-index | 0.00 |
We study Turing computability of the nonlinear solution operator S of the Cauchy problem for the Schrödinger equation of the form idu/dt = -d2u/dx2+mu+ |u|2u in R. We prove that S is a computable operator from H1(R) to C(R;H1(R)) with respect to the canonical representations.