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

Uloženo v:
Podrobná bibliografie
Vydáno 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:angličtina
Vydáno: Gordon and Breach Science Publishers 01.01.1977
Témata:
auxiliary PDM
non-deterministic algorithm
recursive algorithm
stack machine
tape complexity
time complexity
Turing machine
ISSN:0020-7160, 1029-0265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 implement non-deterministic algorithms by deterministic algorithms, and the implementation of recursive algorithms by means of stack machines. Some attention is given to time bounds but the emphasis is on storage-bounded computations.
ISSN:0020-7160
1029-0265
DOI:10.1080/00207167708803124