Re: Turing vs math

From: Juergen Schmidhuber <juergen.domain.name.hidden>
Date: Tue, 2 Nov 1999 10:59:03 +0100

Hal:

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

The precise probabilities are never really computed.

Juergen
Received on Tue Nov 02 1999 - 02:03:36 PST

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