Professor Igor Potapov

About

I am a Professor of Computer Science and a leader of "Algorithms, Complexity Theory and Optimisation" group and a council member of Networks Sciences & Technologies at the Department of Computer Science. My research is mostly in the study of different reachability questions and the boundaries between decidable and undecidable problems that concern automata, formal languages, semigroups and iterative maps. These areas have quite broad connections with algorithms and combinatorics on words, abstract algebra, topology and computation theory. Also, I am interested in designing and analysing algorithms in distributed computational models and particularly in self-organization, pattern formation and analysis of computational power. I have been a Royal Society Apex Award fellow since 2024, focusin