Distinguished Lecture Series in Mathematics and Computer Science

wish to invite you to a conference

 

on January 15th, 2015 at 17:15

Room 570

Education Building - 5th Floor

Refreshments will be served in the lobby of the Caesarea Institute at 16:50 - 6th Floor - Education Building - University of Haifa

 

What is an Algorithm?

Yuri Gurevich

Microsoft Research

 

The title problem is of obvious interest to theorists. We will explain its importance to software engineering, in particular to specification, testing and verification of software and hardware.

Wasn't the problem solved by Turing? No. Of course Turing's contribution was pivotal, but the problem remained open, even for sequential algorithms.

We argue that problem cannot be solved in full generality because the notion of algorithm is still evolving. But certain species of algorithms have matured sufficiently to become amenable to foundational analysis. This applies first of all to sequential algorithm.

In the main part of the lecture we formalize the notion of sequential algorithms in full generality. Then we will mention the other species of algorithms that have been formalized in full generality. Finally, we will describe some applications of this research, in particular at Microsoft.

 

*