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
