Assertion: deterministic algorithm | /r/UsedFor | multiple continuations
Facets:
value: at every possible step
type: MANNER
Source sentences:
text: In computational complexity theory, nondeterministic algorithms are ones that, at every possible step, can allow for multiple continuations (imagine a person walking down a path in a forest