Quantum Hypercomputation

Author: Kieu T.D.1

Source: Minds and Machines, Volume 12, Number 4, November 2002 , pp. 541-561(21)

Publisher: Springer

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Abstract:

We explore the possibility of using quantum mechanical principles for hypercomputation through the consideration of a quantum algorithm for computing the Turing halting problem. The mathematical noncomputability is compensated by the measurability of the values of quantum observables and of the probability distributions for these values. Some previous no-go claims against quantum hypercomputation are then reviewed in the light of this new positive proposal.

Keywords: Hilbert's tenth problem; quantum adiabatic theorem; quantum computation

Language: English

Document Type: Research article

Affiliations: 1: Centre for Atom Optics and Ultrafast Spectroscopy, Swinburne University of Technology, Hawthorn, Victoria 3122, Australia; E-mail: kieu@swin.edu.au

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$47.00 plus tax      Refund Policy

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A