Hi there, and welcome to Byte and Night - calm computer science lectures to help you fall asleep or simply slow down 😴

In this episode, we'll explore the fundamentals of the Theory of Computation, including finite automata, pushdown machines, Turing's big idea, and the boundaries of what can be computed.

0:00 - Introduction
0:52 - Finite automata and regular languages
7:54 - Pushdown Automata and Context-Free Grammars
13:10 - Turing machines and the Church-Turing thesis
18:44 - Decidability and undecidability
24:47 - The halting problem

If you enjoy this kind of content, don't forget to subscribe and follow the channel for more peaceful lectures.

© 2025 Byte and Night 🌙