Although described above in the form of a program in a high-level language, the same algorithm may be implemented with the same asymptotic space bound on a Turing machine.

This algorithm can be applied to an implicit graph whose vertices represent the configurations of a nondeterministic Turing machine and its tape, running within a given space bound . The edges of this graph represent the nondeterministic transitions of the machine, is set to the initial configuration of the machine, and is set