Professor Igor Potapov

Personal Statement

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 the design and analysis of algorithms in distributed computational models and particularly interested in self-organization, pattern formation and analysis of computational power.

In 2020/2 I was a Royal Society Leverhulme Trust Senior Research Fellow, with a project called "Cornerstones of Reachability: Between Automata and Matrix Theories".

Since March 2022 I joined the Science for Ukraine initiative and I am helping with strategic planning to set up and maintain the UK branch activities, exploring funding/sponsorship opportunities, and communicating with media. I have been involved in the coordination of the UK-Ukraine academic mentoring and other research twinning programmes.

Funded Fellowships