Universal Turing Machine, Membership and Halting Problems, and Diagonalization Proofs of Undecidability

An overview of universal Turing machines, the membership and halting problems, and the application of diagonalization techniques to establish undecidability results.