Introduction to the most famous unsolved problem in Computer Science. Introduction to Turing Machines, runtime of algorithms, and the classes P and NP. What would the universe look like if P=NP. History of the problem, and attempts to solve the problem. Example adapted from https://en.wikipedia.org/wiki/Reduction_(complexity).
Published 2016-11-10 · Watch on YouTube ↗ Availability and playback restrictions are controlled by the original channel.
47:49
