Abstract

In the Annual Seminar on Mathematical Logic and its Application, held in Shahid Beheshti University on December 2013, I spoke about a model of computation on real numbers. It is a natural generalization of standard Turing machines. This model fits more closely to the intuition of working mathematicians, for example, the exponential function and the equality predicate are both computable. In this talk, I will first recall briefly what the model is (with some slight improvements). I will also compare it with other existing models, such as BSS and TTE models. Finally I will present Normal Form Theorem. The latter is a joint work (and an ongoing project) with Keng Meng Ng from NTU, Singapore and Nazanin Tavana fron IPM, Iran.



Information: