Join us on June 16, for the Guest Lecture Assisted Algorithms by Yuri Gurevich!

Algorithms are inherently deterministic. Yet there are useful probabilistic and quantum algorithms that are inherently nondeterministic. How do they work? In this talk, Yuri Gurevich presents the theory of assisted algorithms, in which non-algorithmic work — from tossing a coin to quantum measurement — is performed by assistants, partners, or oracles. The talk will use quantum computing as a running example, but no prior knowledge of quantum computing is required.

About Yuri Gurevich

Yuri Gurevich is Professor Emeritus at the University of Michigan. For two decades, he served as a Principal Researcher at Microsoft. He is a highly distinguished figure in the computer science community, recognized as a Guggenheim Fellow and a Fellow of AAAS, ACM, and EATCS, among others. He is also a foreign member of Academia Europaea and holds Doctor Honoris Causa degrees from the Ural Federal University (Russia) and the Hasselt University (Belgium).

Curious about our other news? Subscribe to our news feed, calendar, or newsletter, or follow us on social media.