4 ms·
If you study for the exam, wouldn't that make it deterministic?
by unobatbayar 5y ago
If you study for the exam, wouldn't that make it deterministic?
- remexre 5y agoA non-deterministic Turing machine has the ability to choose "correctly" from a finite set of options. (This corresponds to search, which gives a nice intuitive notion that search can't do better than exponential time without knowledge of the search space unless P=NP.)