Event № 1358
Event № 1358
HF Rothschild Lectures in Mathematics and Computer Science - Yuri Gurevich 15/01/2015, Thursday, 17:15
Name: Rothschild Lectures in Mathematics and Computer Science
Title: What is an Algorithm?
Speaker: Yuri Gurevich
Place: Science & Education Building, Room 570, University of Haifa
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.
SubmittedBy: David Blanc , email@example.com
EventLink: Event № 1358