Re: Arthur O'Dwyer on the feasibility of simulating a Turing Machine

From: Michael Mendelsohn (keine.Werbung.1300_at_michael.mendelsohn.de)
Date: 02/29/04 

Date: Sun, 29 Feb 2004 12:13:34 +0100

Calum schrieb:
> bool array[NUM_PARTICLES_IN_UNIVERSE+1];
> for(int i=0; i<NUM_PARTICLES_IN_UNIVERSE+1; ++i)
> array[i] = is_prime(i);
>
> Your assertion that any desktop PC can compute anything is of course
> ridiculous.

I can easily optimize the array to 1/2 its size... ;)
To simulate means "to perform an equivalent computation".

However, I could prove that a turing machine can make a tape that holds
all numbers from 1 to 2^PARTICLES_IN_UNIVERSE, expressed as a sequences
of 1s, delimited by 0. It would start
...000000000010110111011110111110111111011111110111111110...
The failure for the result to concurrently exist in the universe
illustrates a way that the TM concept fails to correspond to our world.

Michael 

-- 
Feel the stare of my burning hamster and stop smoking!