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

Full description

Saved in:

Bibliographic Details
Published in:	International journal of computer mathematics Vol. 6; no. 1; pp. 3 - 31
Main Author:	Savitch, Walter J.
Format:	Journal Article
Language:	English
Published:	Gordon and Breach Science Publishers 01.01.1977
Subjects:	auxiliary PDM non-deterministic algorithm recursive algorithm stack machine tape complexity time complexity Turing machine
ISSN:	0020-7160, 1029-0265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!