Since the problem space is enumerable, the successively generated problem sets (the P1 sets) also contain an embedded enumeration of the solution elements. Once a solution element is encountered, the machine halts. When there is no solution for the initial problem, the abstract machine thus constructed may never halt.