Computing Schrödinger propagators on type-2 Turing machines

DOI10.1016/j.jco.2006.06.001zbMath1119.03063OpenAlexW2054172671MaRDI QIDQ864440

Ning Zhong, Weihrauch, Klaus

Publication date: 8 February 2007

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2006.06.001

zbMATH Keywords

Sobolev spaceinitial value problemSchrödinger equationcomputabilitytype-2 theory of effectivity

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) PDEs in connection with quantum mechanics (35Q40) Applications of computability and recursion theory (03D80) Constructive operator theory (47S30) Turing machines and related notions (03D10)

Related Items

On Computability of Navier-Stokes’ Equation, Computability of the Solutions to Navier-Stokes Equations via Effective Approximation, Computing the Solution of the m-Korteweg-de Vries Equation on Turing Machines, Unnamed Item, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics, Computability aspects for 1st-order partial differential equations via characteristics, Computability of Differential Equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of representations
• On a class of nonlinear Schrödinger equations. I. The Cauchy problem, general case
• The nonlinear Schrödinger equation. Self-focusing and wave collapse
• Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• Type‐2 computability on spaces of integrable functions
• On the definitions of computable real continuous functions
• Computability theory of generalized functions
• Stetigkeitseigenschaften Berechenbarer Reeller Funktionen
• On Computable Numbers, with an Application to the Entscheidungsproblem