- Contemporary messages sorted: [ by date ] [ by thread ] [ by subject ] [ by author ] [ by messages with attachments ]

From: Ben Goertzel <ben.domain.name.hidden>

Date: Mon, 30 Dec 2002 13:00:22 -0500

*> When a finite quantum computer can break the Turing barrier, that will
*

*> prove something. But when your first step is to prepare an infinite
*

*> superposition, that has no applicability to the physical universe.
*

*>
*

*> Hal Finney
*

*>
*

Precisely. Deutsch's arguments make a lot of assumptions about things being

"finitely given"; Calude's theory makes very different assumptions. If you

take Calude's assumptions and replace them with finite-precision

assumptions, the non-Turing stuff goes away.

Less formally: you need to put noncomputable information into QM to get

noncomputable information out of QM. If you don't explicitly put

noncomputable information into it, you won't get any out.

ben

Received on Mon Dec 30 2002 - 12:57:30 PST

Date: Mon, 30 Dec 2002 13:00:22 -0500

Precisely. Deutsch's arguments make a lot of assumptions about things being

"finitely given"; Calude's theory makes very different assumptions. If you

take Calude's assumptions and replace them with finite-precision

assumptions, the non-Turing stuff goes away.

Less formally: you need to put noncomputable information into QM to get

noncomputable information out of QM. If you don't explicitly put

noncomputable information into it, you won't get any out.

ben

Received on Mon Dec 30 2002 - 12:57:30 PST

*
This archive was generated by hypermail 2.3.0
: Fri Feb 16 2018 - 13:20:07 PST
*