معرفی
Benedikt Pago is a Research Fellow in the Department of Computer Science and Technology at the University of Cambridge, affiliated with Robinson College. He is part of the Logics and Algorithms group led by Anuj Dawar. His research focuses on logic and computational complexity, with a particular emphasis on finite model theory, proof complexity, constraint satisfaction problems, and algebraic complexity. He explores how methods from finite model theory can establish lower bounds in theoretical computer science domains.
His research interests include the limitations of symmetric computation models and proof systems, such as Choiceless Polynomial Time and symmetric circuit models. He has published extensively on topics like game comonads, invertible-map equivalence, and homomorphism indistinguishability. Benedikt has taught courses on computation theory, complexity theory, and probability at the University of Cambridge, and previously lectured on mathematical logic and related subjects at RWTH Aachen University in Germany.
Benedikt’s work bridges foundational aspects of computer science with advanced theoretical frameworks, contributing to both algorithmic and logical perspectives in complexity theory.
