Computation, hypercomputation, and physical science
From MaRDI portal
Publication:959046
DOI10.1016/j.jal.2008.09.007zbMath1167.03002MaRDI QIDQ959046
Publication date: 11 December 2008
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2008.09.007
quantum computers; Church-Turing thesis; hypercomputation; Gandy's thesis; quantum computability; Turing limit
81P68: Quantum computation
03A05: Philosophical and critical aspects of logic and foundations
03D20: Recursive functions and relations, subrecursive hierarchies
68T01: General topics in artificial intelligence
03D10: Turing machines and related notions
68Q01: General topics in the theory of computing
Uses Software
Cites Work
- The wave equation with computable initial data such that its unique solution is not computable
- Does a rock implement every finite-state automaton?
- On code generation in a PASCAL compiler
- The B-Book
- Turing's O-machines, Searle, Penrose and the brain
- Computability and Recursion
- The Mechanical Evaluation of Expressions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item