Adam is a PhD student in algorithms and descriptive complexity theory at the University of Cambridge. His research focuses on the use of logic, algebra and topology in efficient algorithms for constraint satisfaction and graph isomorphism problems. His current work at the Turing seeks to establish upper bounds on the expressive power obtained by computing topological features of data.