Computing a Turing-Incomputable Problem from Quantum Computing

Details Computing a Turing-Incomputable Problem from Quantum Computing Computing a Turing-Incomputable Problem from Quantum Computing

2003-09-26

arxiv.org/abs/quant-ph/0309198v1

Physics

Quantum Physics

12 pages, 8 figures

Scientific paper

A hypercomputation model named Infinite Square Well Hypercomputation Model (ISWHM) is built from quantum computation. This model is inspired by the model proposed by Tien D. Kieu quant-ph/0203034 and solves an Turing-incomputable problem. For the proposed model and problem, a simulation of its behavior is made. Furthermore, it is demonstrated that ISWHM is a universal quantum computation model.

Affiliated with

Also associated with

No associations

Rating

Computing a Turing-Incomputable Problem from Quantum Computing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing a Turing-Incomputable Problem from Quantum Computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing a Turing-Incomputable Problem from Quantum Computing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-565801