#computer science

A little Q-learning, a perfect maze, and two mice running in WebAssembly.

Don’t fear the regex!

Complexity analysis; searching, sorting, finding spanning trees and shortest paths in graphs. Divide & conquer, dynamic programming, and backtracking. Intro to problem classification, i.e., NP, intractable, and unsolvable.

Concepts and formalisms of formal languages and automata theory. Fundamental mathematical concepts, grammars, and corresponding automata. Deterministic parsing of programming languages.

DFAs, NFAs, regular languages. Formal grammars. Pushdown and linear-bounded automata. Turing machines. Decidability.