Colloquium Details
Formalization of the Notion of Algorithm
| Author: | Yuri Gurevich Microsoft Research and University of Michigan |
|---|---|
| Date: | October 28, 1999 |
| Time: | 16:00 |
| Location: | 220 Deschutes |
Abstract
One may think that the title problem was solved long ago by Church and Turing. It wasn't; there is more to an algorithm than the function it computes. (Besides, what function does an operating system compute?) The interest to the problem is not only theoretical. Applications include modeling, specification, verification and design of software and hardware systems. We will explain the sequential Abstract State Machine thesis. If time permits, we will mention parallel, distributed and real-time ASMs.