From: "Yannick Duchêne (Hibou57)" <yannick_duchene@yahoo.fr>
Subject: Re: Quantum computing
Date: Mon, 28 Mar 2011 01:56:10 +0200
Date: 2011-03-28T01:56:10+02:00 [thread overview]
Message-ID: <op.vs00rw0tule2fv@index.ici> (raw)
In-Reply-To: 19a0esjnul0bv$.1r97i1kn0emnf.dlg@40tude.net
Le Mon, 07 Mar 2011 09:43:08 +0100, Dmitry A. Kazakov
<mailbox@dmitry-kazakov.de> a écrit:
> BTW, I don't follow the subject of quantum computing. Does anybody know
> in
> which relation is it to Turing completeness?
Well, Wikipedia says:
A Turing machine can simulate these quantum computers, so such a
quantum computer could never solve an undecidable problem like
the halting problem. The existence of "standard" quantum computers
does not disprove the Church–Turing thesis
Quoted from: http://en.wikipedia.org/wiki/Quantum_computer
There are also, specifically, Quantum Turing Machines:
http://en.wikipedia.org/wiki/Quantum_Turing_machine
--
Si les chats miaulent et font autant de vocalises bizarres, c’est pas pour
les chiens.
“ c++; /* this makes c bigger but returns the old value */ ” [Anonymous]
prev parent reply other threads:[~2011-03-27 23:56 UTC|newest]
Thread overview: 6+ messages / expand[flat|nested] mbox.gz Atom feed top
2011-03-07 1:20 Quantum computing Hoàng Đình Long
2011-03-07 6:04 ` Shark8
2011-03-07 7:37 ` Maciej Sobczak
2011-03-07 8:31 ` Dmitry A. Kazakov
2011-03-07 8:43 ` Dmitry A. Kazakov
2011-03-27 23:56 ` Yannick Duchêne (Hibou57) [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox