Computing a Turing-Incomputable Problem from Quantum Computing

Abstract

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.

12 pages, 8 figures

References in corpus (1)

• Hypercomputation: computing more than the Turing machine

Cited by in corpus (1)

• Quantum adiabatic algorithm for Hilbert's tenth problem: I. The algorithm