Non-deterministic Turing Machine - Bounded Non-determinism

Bounded Non-determinism

An NTM has the property of bounded non-determinism, i.e., if an NTM always halts on a given input tape T then it halts in a bounded number of steps, and therefore can only have a bounded number of possible configurations.

Read more about this topic:  Non-deterministic Turing Machine

Famous quotes containing the word bounded:

    “Me, what’s that after all? An arbitrary limitation of being bounded by the people before and after and on either side. Where they leave off, I begin, and vice versa.”
    —Russell Hoban (b. 1925)