Assertion: deterministic machine | /r/CapableOf | make arbitrary choice
Facets:
value: for each state and symbol pair
type: OTHER
Source sentences:
text: Non-deterministic Turing machines are a kind of choice machines: for each state and symbol pair, the non-deterministic machine makes an arbitrary choice between a finite (possibly zero) number of states.