ASPECTS OF PERSISTENT COMPUTATIONS
Harald Hempel⋆, Madlen Kimmritz · International Journal of Foundations of Computer Science · 2009
In this paper we formally define the notion of persistent Turing machines to model interactive computations. We compare the power of persistent Turing machines with respect to computing functions and relations and accepting sets with their classical counterparts. It turns out that the model of persistent computations leads to new characterizations of known function and language classes as well as to classes that have no classical counterpart.