Re: "Everything" need a little more than 0 information

From: Hal Finney <>
Date: Fri, 29 Nov 2002 18:04:05 -0800

Russell Standish writes to Bruno Marchal:
> As you have well pointed out, the set of all descriptions can be
> computed in c time (c = cardinality of the reals) on an ordinary
> Universal Turing Machine via the UD. It is, however, a nonclassical
> model of computation.

That doesn't sound right to me. Time in the context of a UTM should be
discrete, hence the largest cardinality relevant would be aleph-null,
the cardinality of the integers. Are you sure that c is necessary?

Hal Finney
Received on Fri Nov 29 2002 - 21:04:54 PST

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