A crash course in formal logic https://www.youtube.com/watch?v=ywKZgjpMBUU
A Crash Course in Formal Logic https://www.youtube.com/watch?v=ywKZgjpMBUU
Turing machines – encountering this term in some textbooks will be as intuitive as abracabadra . Just replace the term by “computer program” and it makes reading easier.
How Finite state machines are used in real world. Watch first few minutes for the introduction of FSM
Reading list for Theory of computation. Discusses concepts like primitive recursive functions, turing machines, computability, NP completeness
This is an annotated reading list on the beginning elements of the theory of computable
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.