Quantum hypercomputability?

Minds and Machines 16 (1):87-93 (2006)
  Copy   BIBTEX

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,846

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
274 (#73,971)

6 months
21 (#126,326)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Amit Hagar
Indiana University, Bloomington
Alexandre Korolev
University of British Columbia

Citations of this work

Quantum algorithms: Philosophical lessons.Amit Hagar - 2007 - Minds and Machines 17 (2):233-247.
A brief critique of pure hypercomputation.Paolo Cotogno - 2009 - Minds and Machines 19 (3):391-405.
Programming Infinite Machines.Anton A. Kutsenko - 2019 - Erkenntnis 87 (1):181-189.

Add more citations

References found in this work

Hypercomputation.B. Jack Copeland - 2002 - Minds and Machines 12 (4):461-502.
Non-Turing Computers and Non-Turing Computability.Mark Hogarth - 1994 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1994:126-138.
Quantum hypercomputation.Tien D. Kieu - 2002 - Minds and Machines 12 (4):541-561.

View all 7 references / Add more references