53:51

L17: Using Reductions to Prove Language Undecidable

1:21:10

L19: Uncomputable Functions, and Introduction to Complexity

1:18:38

L7: Contex-Free Grammars and Push-Down Automata

1:06:01

The Church-Turing Thesis: Story and Recent Progress

7:35:08

playlist para estudar como kant despertando do sono dogmático em que sua filosofia estava imergida

1:14:49

6. TM Variants, Church-Turing Thesis

40:08

L16: Unrecognizable Languages and Reductions

1:19:07

L12: Universal Turing Machines; The Halting Problem is Recognizable but Not Decidable