L19: Uncomputable Functions, and Introduction to Complexity

แชร์
ฝัง
  • เผยแพร่เมื่อ 5 ก.พ. 2025
  • Proof by diagonalization that there are uncomputable functions; introduction to complexity theory, big-Oh notation, definition of worst-case for a non-deterministic. Turing machine; definition of the classes P and NP.

ความคิดเห็น • 8