Lecture 39/65: A Language That is Not Turing Recognizable
8:45
Lecture 40/65: Reducibility: A Technique for Proving Undecidability
14:36
Lecture 37/65: Languages That are Not Turing Recognizable
11:34
Closure Properties of Decidable Languages
9:00
Emptiness for Turing Machines is Undecidable
7:35:08
playlist para estudar como kant despertando do sono dogmático em que sua filosofia estava imergida
4:14
The Halting Problem: The Unsolvable Problem
1:04:20
Ludovico Einaudi [relax, study, sleep, soft, calm, inspired piano medley]
7:41:02