Lectures related to Entscheidungsproblem

Explores decidability in Turing machines and recursive languages.

Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.

Covers recursively enumerable languages, Turing machines, and the construction of undecidable languages.

Explores undecidability through recursive languages, Turing machines, and the halting problem.

Covers operational semantics and evaluation strategies in lambda calculus, including redex, alternative evaluation strategies, and Church Booleans.