P vs. NP and the Computational Complexity Zoo
Computer Logic with Chris Dixon
How turing machines were invented https://www.youtube.com/watch?v=-ZS_zFg4w5k
A Turing machine is a model of a machine which can mimic any other (known as a universal machine). What we call “computable” is whatever a Turing machine can write down. This video is about how it was conceived and why it works.