International Journal of Theoretical Physics

, Volume 44, Issue 11, pp 2059–2071

Computational Power of Infinite Quantum Parallelism


DOI: 10.1007/s10773-005-8984-0

Cite this article as:
Ziegler, M. Int J Theor Phys (2005) 44: 2059. doi:10.1007/s10773-005-8984-0


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.

Key Words

Hypercomputation quantum mechanics recursion theory infinite parallelism 

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.University of PaderbornPaderbornGermany

Personalised recommendations