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...

Celý popis

Podrobná bibliografia

Vydané v:	International journal of computer mathematics Ročník 6; číslo 1; s. 3 - 31
Hlavný autor:	Savitch, Walter J.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Gordon and Breach Science Publishers 01.01.1977
Predmet:	auxiliary PDM non-deterministic algorithm recursive algorithm stack machine tape complexity time complexity Turing machine
ISSN:	0020-7160, 1029-0265
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!