If I ran a computer program that systematically emulated every Turing machine, would I thereby create every possible universe?
For example:
n=1;
max = 1;
while (1) {
emulate_one_instruction(n);
n = n+1;
if (n > max)
{max = max + 1; n = 1;}
}
(In other words, the pattern of execution goes 1,1,2,1,2,3,1,2,3,4, and so on. If you wait long enough, this sequence will eventually repeat any number you specify as many times as you specify.)
Of course, you’d need infinite resources to run this for an infinite number of steps...
Hmmmm...
The set of Turing machines is countably infinite.
If I ran a computer program that systematically emulated every Turing machine, would I thereby create every possible universe?
For example:
n=1;
max = 1;
while (1) {
emulate_one_instruction(n);
n = n+1;
if (n > max)
{max = max + 1; n = 1;}
}
(In other words, the pattern of execution goes 1,1,2,1,2,3,1,2,3,4, and so on. If you wait long enough, this sequence will eventually repeat any number you specify as many times as you specify.)
Of course, you’d need infinite resources to run this for an infinite number of steps...
Congratulations, you have reinvented the universal dovetailer