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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Althöfer, I.: Das Dreihirn—Entscheidungsteilung im Schach. Computerschach & Spiele, 20–22 (December 1985)
Althöfer, I., Snatzke, R.G.: Playing Games with Multiple Choice Systems. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 142–153. Springer, Heidelberg (2003)
Brand, M., Frisken, S., Lesh, N., Marks, J., Nikovski, D., Perry, R., Yedidia, J.: Theory and Applied Computing: Observations and Anecdotes. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 106–118. Springer, Heidelberg (2004)
Goldin, D., Wegner, P.: Persistence as a form of interaction, Technical Report CS-98-07, Brown University, Department of Computer Science (1998)
Hempel, H., Kimmritz, M.: Aspects of Persistent Computations (unpublished)
Kosub, S.: Persistent Computations, Technical Report No. 217, Julius-Maximilians-Universität Würzburg, Institut für Informatik (1998)
Klau, G., Lesh, N., Marks, J., Mitzenmacher, M.: Human-guided tabu search. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence, Fourteenth Conference on Innovative Applications of Artificial Intelligence 2002, pp. 41–47. AAAI Press, Menlo Park (2002)
Lesh, N., Mitzenmacher, M., Whitesides, S.: A complete and effective move set for simplified protein folding. In: Proceedings of the Seventh Annual International Conference on Research in Computational Molecular Biology, pp. 188–195 (2003)
Lesh, N., Marks, J., McMahon, A., Mitzenmacher, M.: New exhaustive, heuristic, and interactive approaches to 2D rectengular strip packing, TR2003-05. Mitsubishi Electric Research Laboratories, Cambridge (May 2003)
Robinson, R.: General recursive functions. Proceedings of the American Mathematical Society 1, JO 3-718 (1950)
Rogers, H.: The Theory of Recursive Functions and Effective Computability, 2nd edn. (1987). MIT Press, Cambridge (1967)
Schöning, U.: Theoretische Informatik kurz gefasst, Mannheim; Leipzig; Wien; Zürich: BI-Wissenschaftsverlag (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hempel, H., Kimmritz, M. (2008). Persistent Computations of Turing Machines. In: Ibarra, O.H., Ravikumar, B. (eds) Implementation and Applications of Automata. CIAA 2008. Lecture Notes in Computer Science, vol 5148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70844-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-70844-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70843-8
Online ISBN: 978-3-540-70844-5
eBook Packages: Computer ScienceComputer Science (R0)