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:

    I could be bounded in a nutshell and count myself a king of
    infinite space, were it not that I have bad dreams.
    William Shakespeare (1564–1616)