THE PHYSICAL CHURCH-TURING THESIS AND THE PRINCIPLES OF QUANTUM THEORY
From MaRDI portal
Publication:4902897
DOI10.1142/S0129054112500153zbMath1279.68096arXiv1102.1612MaRDI QIDQ4902897
Publication date: 18 January 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.1612
81P68: Quantum computation
68Q80: Cellular automata (computational aspects)
68Q12: Quantum algorithms and complexity in the theory of computing
Related Items
Cites Work
- Unnamed Item
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
- More really is different
- Embedding infinitely parallel computation in Newtonian kinematics
- Locality and information transfer in quantum operations
- Experimental computation of real numbers by Newtonian machines
- Quantum theory: concepts and methods
- Non-Turing computations via Malament--Hogarth space-times