Is the Schrödinger propagator Turing computable (0)

by K Weihrauch, N Zhong
Venue:Computability and complexity in Analysis, Springer Lecture Notes in Computer Science, Volume