

Author: Ziegler Martin
Publisher: Springer Publishing Company
ISSN: 0020-7748
Source: International Journal of Theoretical Physics, Vol.44, Iss.11, 2005-11, pp. : 2059-2071
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Recent works have independently suggested that quantum mechanics might permit procedures that fundamentally transcend the power of Turing Machines as well as of ‘standard’ Quantum Computers. These approaches rely on and indicate that quantum mechanics seems to support some infinite variant of classical parallel computing.We compare this new one with other attempts towards hypercomputation by separating (1) its %principal computing capabilities from (2) realizability issues. The first are shown to coincide with recursive enumerability; the second are considered in analogy to ‘existence’ in mathematical logic.
Related content


Interpreting Quantum Parallelism by Sequents
International Journal of Theoretical Physics, Vol. 49, Iss. 12, 2010-12 ,pp. :






Infinite degeneracy of states in quantum gravity
Journal of Physics: Conference Series , Vol. 306, Iss. 1, 2011-07 ,pp. :


Quantum computational geodesics
Journal of Modern Optics, Vol. 56, Iss. 18-19, 2009-10 ,pp. :