Dr. Klaus Ambos-Spies, professor from Heidelberg University in Germany, presented on computability to students and faculty from Computer Science and Mathematics on Nov. 1. His visit to campus allowed him to work with Dr. Xizhong Zheng, professor of Computer Science and Mathematics, on computability problems.

Dr. Ambos-Spies spoke on how computability theory explores the limits of algorithmic method, presenting students with examples of algorithmically unsolvable problems. He also provided a historical context for computability through anecdotes about famous personalities involved in the early developments of theoretical concepts, such as British scientist Alan Turing, who created a machine during World War II to break the German Enigma code and is considered to have laid the groundwork to modern computing.