Skip to main content
Conference Proceedings

Persistent computations of turing machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5148 LNCS 171-180
DOI: 10.1007/978-3-540-70844-5_18
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we formally define the notion of persistent Turing machines to model interactive computations. We compare the power of persistent computations with their classical counterparts. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hempel, H., & Kimmritz, M. (2008). Persistent computations of turing machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5148 LNCS, pp. 171–180). https://doi.org/10.1007/978-3-540-70844-5_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free