Abstract
In this note we study Turing computability of the linear inhomogeneous Schrödinger propagator S. We prove: (1) S is computable when the initial functions are from Sobolev spaces. (2) When acting on L p(ℝd), S is computable, if and only if p = 2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
José Barros-Neto. An introduction to the theory of distributions, volume 14 of Pure and Applied Mathematics. Marcel Dekker Inc., New York, 1973.
Vasco Brattka. Computable invariance. Theoretical Computer Science, 210:3–20, 1999.
Marian B. Pour-El and J. Ian Richards. Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin, 1989.
Marian Pour-El and Ning Zhong. The wave equation with computable initial data whose unique solution is nowhere computable. Mathematical Logic Quarterly, 43(4):499–509, 1997.
Jeffrey Rauch. Partial Differential Equations, volume 128 of Graduate Texts in Mathematics. Springer, New York, 1991.
Catherine Sulem and Pierre-Louis Sulem. The Nonlinear Schrüdinger Equation, volume 128 of Applied Mathematical Sciences. Springer, New York, 1999.
Klaus Weihrauch. Computable Analysis. Springer, Berlin, 2000.
Klaus Weihrauch and Ning Zhong. The wave propagator is Turing computable. In Ker-I Ko, Anil Nerode, Marian B. Pour-El, Klaus Weihrauch, and Jiří Wiedermann, editors, Computability and Complexity in Analysis, volume 235 of Informatik Berichte, pages 127–155. FernUniversität Hagen, August 1998. CCA Workshop, Brno, Czech Republic, August, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Additional information
Work partially supported by DFG Grant Me 872/7-3.
Work partially supported by DFG Grant BR 1807/4-1.
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weihrauch, K., Zhong, N. (2001). Is the Linear Schrödinger Propagator Turing Computable?. In: Blanck, J., Brattka, V., Hertling, P. (eds) Computability and Complexity in Analysis. CCA 2000. Lecture Notes in Computer Science, vol 2064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_22
Download citation
DOI: https://doi.org/10.1007/3-540-45335-0_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42197-9
Online ISBN: 978-3-540-45335-2
eBook Packages: Springer Book Archive