Numerical Simulations of a Possible Hypercomputational Quantum Algorithm
The 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, the 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.
KeywordsCoherent State Turing Machine Quantum Algorithm Diophantine Equation Adiabatic Theorem
Unable to display preview. Download preview PDF.
- Stannett M. (2003) Hypercomputation models. In: Teuscher C. (ed.) Alan Turing: life and legaly of a great thinker 2003. Springer, Berlin, pp. 135–157Google Scholar
- Sicard A., Vélez M. (2001) Hipercomputación: la próxima generatión de la computation (Spanish). Revista Universidad EAFIT, 123: 47–51Google Scholar
- Sicard A., Vélez M., Ospina J. (2004)Hypercomputation based on quantun computation. Eprint arXiv.org/abs/quant-ph/0406137Google Scholar
- Matiyasevich Y. V. (1993) Hilbert’s tenth problem. The MIT Press, Cambridge, MassachusettsGoogle Scholar
- Kieu T. D. (2002) Quantum adiabatic algorithm for Hilbert’s tenth problem: I. The algorithm. Eprint arXiv.org/abs/quant-ph/0310052Google Scholar
- Kieu T. D. (2003) Numerical simulations of a quantum algorithm for Hilbert’s tenth problem. In: Donkor E., Pirich A. R., Brandt H. E. (eds.) Quantum Information and Computation, vol.5105 of Proc. of SPIE, SPIE, Bellingham, WA, pp. 89–95Google Scholar