Minds and Machines
Minds and Machines
Physical Hypercomputation and the Church–Turing Thesis
Minds and Machines
The quantum adiabatic optimization algorithm and local minima
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum Algorithms: Philosophical Lessons
Minds and Machines
Physical Computation: How General are Gandy's Principles for Mechanisms?
Minds and Machines
From Logic to Physics: How the Meaning of Computation Changed over Time
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
A Brief Critique of Pure Hypercomputation
Minds and Machines
Non-classical computing: feasible versus infeasible
Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference
| Hi-index | 0.00 |
A recent proposal to solve the halting problem with the quantum adiabatic algorithm is criticized and found wanting. Contrary to other physical hypercomputers, where one believes that a physical process "computes" a (recursive-theoretic) non-computable function simply because one believes the physical theory that presumably governs or describes such process, believing the theory (i.e., quantum mechanics) in the case of the quantum adiabatic "hypercomputer" is tantamount to acknowledging that the hypercomputer cannot perform its task.