On 11 May 2015 at 03:47, Bruno Marchal <[email protected]> wrote: > On 09 May 2015, at 04:59, LizR wrote: > > If the computation isn't classical, and can't be made classical, then comp > fails at step 0 > > > But the concept of computation is classical. We need classical logic to > say that phi_i(j) converges on not. > > Quantum computation does not violate Church Thesis, and is not a threat to > computability theory, even if it is a threat to human computers society > which does not invest in quantum computing (perhaps). > > Yes, I wasn't saying "if the computation can't be made classical" meaning "if it's a quantum computation" - in fact I meant the opposite. I know a qc can be made classical. I mean if it can't be made classical at all (in which case it's magic, or at least contains an oracle or hypercomputer) then comp fails. But I doubt it can easily be made non-classical, which would need non-Turing-complete physics I imagine.
-- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
