Computing a Turing-Incomputable Problem from Quantum Computing

Simple item page
dc.creatorSicard, Andrés
dc.creatorVélez, Mario
dc.creatorOspina, Juan
dc.date2003-09-26
dc.date.accessioned2026-07-07T06:07:56Z
dc.date.available2026-07-07T06:07:56Z
dc.descriptionA 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.
dc.description12 pages, 8 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0309198
dc.identifierhttp://arxiv.org/abs/quant-ph/0309198
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91468
dc.subjectQuantum Physics
dc.titleComputing a Turing-Incomputable Problem from Quantum Computing
dc.typetext

Files

Collections

arXiv