Title of the course: Unsolvable problems
Instructor: Assoc. Prof. Ahmet Çevik
Institution: JSGA/ODTÜ
Dates: 14-20 September 2026
Prerequisites: None.
Level: All undergraduates
Abstract: We will introduce the mathematical notion of algorithmic (un)solvability and define what it means to compute a set or a function. We will then present various abstract problems that are unsolvable by means of algorithms, including problems of combinatorics, group theory, formal language theory, linear algebra, and even theoretical physics.
Language: TR, EN