2001/11/10 by Tien D. Kieu, Tien D Kieu, Kieu, Tien D
Physics and Astronomy · #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0111062
Clarification and new references added
arxiv created 2001/11/21 · arxiv updated 2009/12/01
To explore the limitation of a class of quantum algorithms originally proposed for the Hilbert's tenth problem, we consider two further classes of mathematically non-decidable problems, those of a modified version of the Hilbert's tenth problem and of the computation of the Chaitin's Ω number, which is a representation of the Gödel's Incompletness theorem. Some interesting connection to Quantum Field Theory is pointed out.