Colloqiuim-Infinite time Blum-Shub-Smale machines - computability for analysis

Title: Infinite time Blum-Shub-Smale machines - computability for analysis 

Speaker:  Andrei Morozov, Sobolev Institute of Mathematics, Novosibirsk, Russia

Date and Time: Friday, February 9, 1:00-2:00pm
Place: Rome 204

Abstract :  We will present a concept of computability over the reals based on Blum-Shub-Smale machines working in infinite time (ITBM). We will give some characterizations of this computability, prove some of its properties, and discuss its adequacy for the classical analysis. This is joint with Peter Koepke.

Bio: Andrey Morozov is Principal Research Fellow at the Sobolev Institute of Mathematics of the Siberian branch of the Russian Academy of Sciences, where he serves as the head of the Laboratory of Logical Systems. He is also Professor of Mathematics at the Novosibirsk State University. His research focuses on computability theory, computable algebra, and generalized computability theory. Morozov was Alexander von Humboldt Fellow at Heidelberg University and Bonn University, and was a Columbian Professor at GWU.  He is deputy editor-in-chief for the journal Siberian Electronic Mathematical Reports.