| Topic: |
Science > Physics |
| User: |
"Acid Pooh" |
| Date: |
23 Sep 2003 01:02:02 AM |
| Object: |
Halting Problem in Quantum Computing |
What would happen if a quantum computer were to be fed an algorithm
which takes other algorithms as inputs and tries to determine if it
will halt? It will obviously never stop, but are there any
interesting physical results of such a system? Perhaps a violation of
conservation of energy? Or a small explosion? Such an exploding
quantum computer would be great to have around the lab.
'cid
(seriously, is there any literature regarding the halting problem in
this context?)
.
|
|
| User: "klaus hoffmann" |
|
| Title: Re: Halting Problem in Quantum Computing |
23 Sep 2003 03:54:08 AM |
|
|
Acid Pooh schrieb:
What would happen if a quantum computer were to be fed an algorithm
which takes other algorithms as inputs and tries to determine if it
will halt? It will obviously never stop, but are there any
interesting physical results of such a system? Perhaps a violation of
conservation of energy? Or a small explosion? Such an exploding
quantum computer would be great to have around the lab.
A quantum computer with n Qbits can be simulated in polynomial time with respect
to 2^n. It has a "performance advantage" that can't solve impossible problems.
hth
Klaus
'cid
(seriously, is there any literature regarding the halting problem in
this context?)
.
|
|
|
|
|
Related Articles |
eer
UFO science key to halting climate change: loony old senator
Equivalency between the undeciability of the halting problem and the 2nd law of thermodynamics.
Call for Papers: IAENG International Conference on Scientific Computing (ICSC 2008)
>>>>>>Matrix Computing to Infinite Universes<<<<<<<<
Re: Why Quantum Computing Is Bunk
Evolution of Intelligence Requires Natural "Quantum Computing"
Re: Shor's algorithm. Check this arxiv.com paper out on quantum computing
| Call For Participation: WORLDCOMP'07: joint conferences in CS, CE, and applied computing, June 25-28, 2007, Las Vegas
Quantum Computing Software
Pythagoras's theorem is not simply a way of computing hypotenuses,but an emblem of the discovery process itself
Re: Why Quantum Computing Is Bunk
Call For Papers: Applied Computing, Computer Science and Eng. Conferences, June 26-29, 2006, USA--WORLDCOMP'06
Computing to Infinite is it possible?
Call for Papers: WORLDCOMP'07, Las Vegas, June 25-28, Conferences in Computer Science, Computer Engineering, and Applied Computing
|
|
|
