Re: Provable vs Computable

From: George Levy <>
Date: Fri, 04 May 2001 22:32:50 -0700 wrote:

> Example: a never ending universe history h is computed by a finite
> nonhalting program p. To simulate randomness and noise etc, p invokes a
> short pseudorandom generator subroutine q which also never halts. The
> n-th pseudorandom event of history h is based on q's n-th output bit
> q(n) which is initialized by 0 and set to 1 as soon as the n-th element
> of an ordered list of all possible program prefixes halts. Whenever q
> modifies some q(n) that was already used in the previous computation of
> h, p appropriately recomputes h since the n-th pseudorandom event.
> Such a virtual reality or universe is perfectly well-defined.

Such a universe would violate Bell' inequality theorem. Quantum randomness
cannot be simulated by hidden variables. We have to move beyond get a model of objective reality we must first develop a
model of consciousness.

Received on Fri May 04 2001 - 22:33:56 PDT

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