Re: Turing vs math

From: <hal.domain.name.hidden>
Date: Fri, 29 Oct 1999 10:41:29 -0700

Juergen writes:
> UTM theory is falsifiable. It makes many predictions. One of them is
> that nobody will ever construct a Super-Turing machine based on QM.

What about the fact, which I mentioned earlier, that probabilities are
based on Kolmogorov complexity, but that is uncomputable, or at least
it would require a super-TM to compute it. However we do observe
probabilities and their effects, hence K. complexity is being computed,
hence there must be a super-TM somewhere to compute it.

Hal
Received on Fri Oct 29 1999 - 10:53:00 PDT