26-f DMC: Turing Machine encodings. Turing Machines can be listed. Turing Machines are countable.

Foundations of Computer Science, Rensselaer Fall 2020. Professor Malik Magdon-Ismail talks about Turing Machines, our gold standard model of computing. We build some Turing Machines to get a hang of things, but focus on high-level pseudo-code. This is the twenty-sixth lecture in a "theory" course focusing on discrete math and the foundations of computing: what can we compute and what can't we compute. Level of the course: Sophomore Computer Science or related major. Material is from Chapter 26 of "Discrete Mathematics and Computing", dmc-book.com.