> 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.