Lecture 37/65: Languages That are Not Turing Recognizable
10:33
Lecture 38/65: The Undecidability of the Halting Problem
8:08
Regularity in Turing Machines is Undecidable
7:42
Decidability and Undecidability
6:14
Turing & The Halting Problem - Computerphile
1:14:49
6. TM Variants, Church-Turing Thesis
12:07
Acceptance for Turing Machines is Undecidable, but Recognizable
1:03:43
Cómo hablar
31:58