General information

Lectures: TR 1:00-2:25, on ZOOM
Office hours: T 2:25-4:00, or by appointment
E-mail: vidnyanszkyz_at^protonmail_dot_com
Notes, recordings, homeworks
Grading: based on weekly homeworks


We will cover a wide range of topics, connected to undecidability (Post's correspondence problem, Wang tilings), decidable theories, computational complexity (definitions and properties of the most important classes, P vs NP), and effective descriptive set theory. Familiarity with the topics covered in Ma117a,b is and advantage, but not necessary to understand the material to be covered.