Is the Linear Schrödinger Propagator Turing Computable?

Klaus Weihrauch, Ning Zhong 0002. Is the Linear Schrödinger Propagator Turing Computable?. In Jens Blanck, Vasco Brattka, Peter Hertling, editors, Computability and Complexity in Analysis, 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers. Volume 2064 of Lecture Notes in Computer Science, pages 369-377, Springer, 2000. [doi]

Abstract

Abstract is missing.