This set of Turing machines is the set of <i>all</i> Turing machines. But you misunderstand, I am only simulating a single step (constant time) of a finite number of Turing machines in any given iteration of the inner loop.<p>It goes <i>arbitrarily far</i> beyond NP hard complexity, which is my point. Wolfram ignores complexity entirely, and that means this algorithm is fair game.