Re: Turing vs math

From: <>
Date: Tue, 2 Nov 1999 07:59:36 -0800 (Juergen Schmidhuber) writes:
> 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.

Perhaps not, but approximate ones are computed and we observe the effects,
aren't they? Approximate probabilities based on approximations to the
K. complexity of a string are no more computable than precise ones.
There is no fixed bound B which allows you to compute the K. complexity
of an arbitrary string within accuracy B.

Received on Tue Nov 02 1999 - 08:02:19 PST

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