معرفی
Charles M Harris is a Lecturer in Pure Mathematics at the School of Mathematics, University of Bristol. His academic training includes a BSc from the University of Bristol, an MSc from King's College London, a DEA from Paris, and a PhD from the University of Leeds.
- Education: BSc (Bristol), MSc (King's College London), DEA (Paris), PhD (Leeds)
Harris specializes in Computability Theory, with a focus on Computable Combinatorics and Reverse Mathematics. His research explores enumeration reducibility, automorphism structures of linear orderings, jump inversion, and noncuppable enumeration degrees. Key contributions include work on maximal block functions, symmetric enumeration degrees, and polynomial-time bounded reducibility.
His publications (15 most recent) span topics in computable orderings, enumeration degree theory, and algorithmic combinatorics. Articles often intersect with mathematical logic and recursion theory, addressing foundational questions about computability and complexity.
