News for hackers. Stuff that matters.
Re:MIT 18.404J – Theory of Computation [video] by remexre on Monday October 11, 2021 @01:52AM (#28825165)
A 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.)

There are no comments on this comment yet.