February 16
Andrei Morozov,
Sobolev Institute of Mathematics
Infinite time Blum-Shub-Smale machines: a computability for analysis
We study a concept of computability over the reals based on Blum-Shub-Smale machines working in infinite time (ITBM). We give some characterizations of this computability, prove some its properties, and discuss its adequacy to classical analysis. This is joint work with Peter Koepke.