GTM-Example:Limits of virtual realities and programmable universes?

• x=x(1),x(2),x(3),… is bitstring representing history of discrete universe; x(1) big bang; x(k) state at step k. The n-th “noisy” pseudorandom bit =1 iff n-th program halts.

• Can’t compute this and only this on MTM - in general need GTM.

Previous slide

Next slide

Back to first slide

View graphic version