James Worrell has a BA in Mathematics and a DPhil in Computer Science, both from the University of Oxford.
He is currently a University Lecturer in the Department of Computer Science. His research interests are in algorithms and complexity bounds for decision problems about state machines, including Markov chains, timed and hybrid automata, counter machines and Petri nets. He is also interested in decision procedures for temporal logic and fragments of arithmetic.
He is currently Tutor for Admissions at Green Templeton College.