Paul studied for a BSc in Computer Science at the University of Liverpool in 2004, followed by a PhD in Theoretical Computer Science in 2007. He held Postdoctoral Research Associate positions at Turku University (Finland), Universite Catholique de Louvain (Belgium) and the University of Liverpool.
He joined the Department of Computer Science at Loughborough University in 2011 as a Lecturer and the School of Computer Science and Mathematics at Liverpool John Moores University in 2017 as a Senior Lecturer. He joined the School of Computer Science and Mathematics at Keele University in 2022 as a Reader in Computability and Automata Theory.
Research and scholarship
Paul's research areas are within Theoretical Computer Science and Mathematics. His research spans topics in reachability and verification of algebraic structures, dynamical systems and hybrid systems; formal languages, combinatorics on words and theory of computation; probabilistic and quantum automata; online algorithms and computational geometry.
He is also interested in the design and analysis of efficient algorithms in a variety of domains and determining the complexity and computability of various problems.
He was co-chair of Reachability Problems 2021 (RP21) and the British Colloquium of Theoretical Computer Science 2014 (BCTCS14). He is a regular reviewer for leading international conferences and journals and was the programme committee of Reachability Problems for several years.