Persistent Computations of Turing Machines

Authors:
Harald Hempel;Madlen Kimmritz
Affiliations:
Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany 07743;Mathematisches Seminar, Christian-Albrechts-Universität zu Kiel, Kiel, Germany 24098
Venue:
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Year:
2008

Citing 4
Cited 0

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
A complete and effective move set for simplified protein folding

RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Human-guided tabu search

Eighteenth national conference on Artificial intelligence
Persistence as a Form of Interaction

Persistence as a Form of Interaction

Quantified Score

Hi-index	0.00

Visualization

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.