Euler 200 | MWF 11AM | Final Mon Dec 13, 8AM

Soundtrack

Lectures

2021-12-13 - Final Presentations

2021-11-29 - Project Start

2021-11-19- Busy Beaver - Slides

2021-11-08 - Space Complexity - Slides

2021-11-08 - Time Complexity - Slides

2021-11-08 - Diagonalization - Slides

2021-11-08 - Decidability - Slides

2021-11-03 - Turing Machines 2 - Slides

2021-11-01 - Turing Machines - Slides

2021-10-27 - Context Free Grammars - Slides

2021-10-22 - Pushdown Automata - Slides

2021-10-13 - Pumping Lemma Final - Slides

2021-10-11 - Pumping Lemma Tables - Slides

2021-10-06 - Intro to Pumping Lemma - Slides

2021-10-04 - Biblical Integration of ToC

2021-10-01 - DFA to Regex - Slides

2021-09-29 - Regex - Slides

2021-09-27 - Google Interview Followup, Review

2021-09-24 - Google Interview Friday

2021-09-22 - NFA Shortcuts - Slides

2021-09-20 - NFA Practice - Slides

2021-09-17 - NFA - Slides

2021-09-15 - DFA Irregularity - Slides

2021-09-13 - DFAs and Regular Languages - Slides

2021-09-10 - DFA - Slides

2021-09-08 - Intro to Automata - Slides

2021-09-03 - Intro to Complexity, Computability, Automata - Slides

2021-09-01 - Intro to 143 - Slides

Golang

COS 435 - Theory of Computation