Ken Regan

Ken Regan is a Professor in the Department of Computer Science and Engineering at the University at Buffalo, part of the School of Engineering and Applied Sciences. He holds a PhD in Mathematics from Oxford University (1986) and a BS in Mathematics from Princeton University (1981). His research focuses on theoretical computer science, mathematical logic, quantum algorithms, computational complexity, and the intersection of chess and computational analysis. He maintains an active blog, "Gödel's Lost Letter and P=NP", and his work often explores foundational questions in complexity theory and algorithm design.

Regan's research interests include quantum computing, where he has contributed to topics like stabilizer circuits, quantum polynomial invariants, and algorithmic approaches rooted in linear algebra. He also investigates cognitive aspects of learning and problem-solving, such as measuring learners’ cognitive load through algorithm visualization tools. His work on chess combines computational analysis with historical and algorithmic perspectives, as seen in his studies linking computer science concepts to chess strategy.

Notable contributions include explorations of P vs NP, Hilbert’s irreducibility theorem, and the application of quantum principles to circuit design. Regan’s publications span over three decades, reflecting his interdisciplinary approach to bridging abstract theory with practical computational challenges. He is affiliated with Google Scholar and maintains a personal academic website detailing his ongoing projects and collaborations.