Assisted Algorithms

We are pleased to invite you to a guest talk by Yuri Gurevich, Professor Emeritus at the University of Michigan and former Principal Researcher at Microsoft

DATE:	Tuesday, June 16, 2026
TIME:	11:00 – 13:00
VENUE:	FAV Hörsaal 3 Zemanek, HHEG01, Favoritenstraße 11

ABSTRACT

Algorithms are inherently deterministic. Yet there are useful probabilistic and quantum algorithms that are inherently non-deterministic. How do they work?

In this talk, Yuri Gurevich presents the theory of assisted algorithms, where non-algorithmic work — from tossing a coin to quantum measurement — is performed by assistants, partners, oracles. The talk will use quantum computing as a running example, but no prior knowledge of quantum computing is required.

About the Speaker

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 both Belgian and Russian universities.

Everyone is welcome to attend! We look forward to seeing you there.