Computational power of infinite quantum parallelism

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 160
  • Download : 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.
Publisher
SPRINGER/PLENUM PUBLISHERS
Issue Date
2005-11
Language
English
Article Type
Article; Proceedings Paper
Keywords

TURING-MACHINES; HYPERCOMPUTATION; TIME

Citation

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, v.44, no.11, pp.2059 - 2071

ISSN
0020-7748
DOI
10.1007/s10773-005-8984-0
URI
http://hdl.handle.net/10203/203402
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0