Lectures related to Turing completeness

Covers first-order logic syntax, semantics, Skolemization, resolution, and normal form transformations.

Explores the unsolvability of the halting problem in algorithms and the limitations of procedures in determining program halting.

Covers the theory of computability and the halting problem in algorithms.

Explores the halting problem, demonstrating its unsolvability and the limitations of algorithms.

Delves into type checking, reconstruction, equations, unification, Hindley/Milner system, polymorphism, and principal types.

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

Explores blockchain, smart contracts, decentralized governance, and the challenges faced by technologies like DAOs.