معرفی
Thomas Powell is a Senior Lecturer (equivalent to Associate Professor) in the Department of Computer Science at the University of Bath. He is a member of the Mathematical Foundations of Computation group. His research focuses on proof theory, computability theory, program semantics, and their applications in mathematics and computer science. Powell holds a PhD in Computer Science from Queen Mary University of London (2013), an MA in Mathematics (Part III) from the University of Cambridge (2009), and a BA in Mathematics (2008).
His research interests include proof mining, functional analysis, stochastic processes, and computational algebra. He has led projects funded by the Engineering and Physical Sciences Research Council (EPSRC) and the London Mathematical Society, focusing on imperative program extraction from proofs and logic seminars.
Key projects include the EPSRC-funded project Imperative Programs from Proofs and organizing the Southern and Midlands Logic Seminar. Powell has advised multiple PhD students, including Morenikeji Neri and Franziskus Wiesnet, and teaches courses on Foundations of Computation and Data Structures and Algorithms at the University of Bath.
Publications span theoretical computer science and mathematics, with recent work on stochastic processes, Tauberian theorems, and algorithmic algebra. His research bridges foundational proof theory with practical applications in analysis and optimization.
