Computability theory establishes which problems can in principle be solved by mechanical procedures, formalised by the Turing machine model and its equivalents. It draws a firm boundary between ...

Computability theory investigates the fundamental limits and capabilities of algorithmic processes, asking which problems can be solved by a mechanical procedure and how efficiently. Algebraic ...

Aug 2: I'll have 2-hour office hours on Wed, Aug 7, 11:30-13:30. Aug 2: The final exam on Aug 8 will be on all topics of the course, with equal emphasis. You'll have 3 hours for an exam that will be ...