Numerical Simulations of a Possible Hypercomputational Quantum Algorithm

dc.creatorSicard, Andrés
dc.creatorOspina, Juan
dc.creatorVélez, Mario
dc.date2005-04-05
dc.date.accessioned2026-07-07T06:12:30Z
dc.date.available2026-07-07T06:12:30Z
dc.descriptionThe hypercomputers compute functions or numbers, or more generally solve problems or carry out tasks, that cannot be computed or solved by a Turing machine. Several numerical simulations of a possible hypercomputational algorithm based on quantum computations previously constructed by the authors are presented. The hypercomputability of our algorithm is based on the fact that this algorithm could solve a classically non-computable decision problem, Hilbert's tenth problem. The numerical simulations were realized for three types of Diophantine equations: with and without solutions in non-negative integers, and without solutions by way of various traditional mathematical packages.
dc.description4 pages, 3 figures, uses icannga05.sty
dc.identifierhttps://arxiv.org/abs/quant-ph/0504021
dc.identifierhttp://arxiv.org/abs/quant-ph/0504021
dc.identifierIn "Adaptive and Natural Computing Algorithms. Proc. of the International Conference in Coimbra, Portugal". Bernardete Ribeiro et al. (eds.). SpringerWienNewYork, 2005. p. 272--275
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/92802
dc.subjectQuantum Physics
dc.subjectLogic in Computer Science
dc.titleNumerical Simulations of a Possible Hypercomputational Quantum Algorithm
dc.typetext

Files

Collections