Is the Linear Schrödinger Propagator Turing Computable?

Authors:
Klaus Weihrauch;Ning Zhong
Affiliations:
-;-
Venue:
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Year:
2000

Citing 2
Cited 1

Computable invariance

Theoretical Computer Science - Special issue on real numbers and computers
Computable analysis: an introduction

Computable analysis: an introduction

Can Newtonian systems, bounded in space, time, mass and energy compute all functions?

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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 Lp(Rd), S is computable, if and only if p = 2.