Recursive turing machines

The Turing machine model is extended to allow for recursive calls and the basic theory of these machines is developed. The model is also used to study the following additional topics: The time and storage needed to implement recursive algorithms by non-recursive algorithms, the storage needed to imp...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of computer mathematics Jg. 6; H. 1; S. 3 - 31
1. Verfasser:	Savitch, Walter J.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Gordon and Breach Science Publishers 01.01.1977
Schlagworte:	auxiliary PDM non-deterministic algorithm recursive algorithm stack machine tape complexity time complexity Turing machine
ISSN:	0020-7160, 1029-0265
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!