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

Gespeichert in:
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!
Abstract 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.
AbstractList 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.
Author Savitch, Walter J.
Author_xml – sequence: 1
  givenname: Walter J.
  surname: Savitch
  fullname: Savitch, Walter J.
  organization: Computer Science Division, Department of Applied Physics and information Science , University of California at San Diego
BookMark eNp9z01LAzEQBuAgFWyrP6C3_oHVSbI7yYIXKX5BQRA9hzQfGtnNSpIq_fduqSdFT3OYeV7mnZFJHKIjZEHhnIKECwAGgqIQICVwyuojMqXA2goYNhMy3e-r8QBOyCznNwCQrcApWTw6s005fLhl2aYQX5a9Nq8hunxKjr3usjv7nnPyfHP9tLqr1g-396urdWVYi6WqwTHZ2JpS09QCNTeIGhmzcnzCN4hyg2A4c1KDcRstPLOG1hKtE67hls-JOOSaNOScnFcmFF3CEEvSoVMU1L6h-tVwlPSHfE-h12n3r7k8mBD9kHr9OaTOqqJ33ZB80tGErPjf_AtsGGUJ
CitedBy_id crossref_primary_10_1080_03155986_1981_11731805
crossref_primary_10_1145_322108_322119
crossref_primary_10_1080_00207167908803180
crossref_primary_10_1007_BF01786979
crossref_primary_10_1137_0209029
Cites_doi 10.1016/S0022-0000(70)80006-X
10.1145/321623.321625
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 1977
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 1977
DBID AAYXX
CITATION
DOI 10.1080/00207167708803124
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1029-0265
EndPage 31
ExternalDocumentID 10_1080_00207167708803124
8803124
GroupedDBID -~X
07G
0R~
1TA
4.4
5GY
5VS
AAIKQ
AAKBW
AAYJJ
ABEFU
ABJNI
ABUFD
ACGEE
ACGEJ
ACGFS
ACGOD
ACIWK
ACNCT
ADCVX
ADXPE
AENEX
AEPSL
AEUMN
AEYOC
AFFNX
AGLEN
AI.
ALMA_UNASSIGNED_HOLDINGS
AMVHM
AMXXU
AQTUD
AWYRJ
BCCOT
BPLKW
C06
CS3
DU5
DWIFK
EBS
EJD
H13
HZ~
IVXBP
NA5
NUSFT
NY~
O9-
P2P
PQQKQ
TAQ
TDBHL
TFL
TFMCV
TFW
TN5
TOXWX
UB9
UPT
UU8
V3K
V4Q
VH1
WH7
ZY4
.4S
.7F
.DC
.QJ
0BK
29J
30N
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
AAYXX
ABCCY
ABDBF
ABFIM
ABHAV
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACAGQ
ACTCW
ACTIO
ACUHS
ADGTB
AEISY
AEOZL
AFKVX
AFRVT
AGCQS
AGDLA
AGMYJ
AGROQ
AHDZW
AHMOU
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALCKM
ALQZU
AMEWO
AQRUH
ARCSS
AVBZW
BLEHA
CAG
CCCUG
CE4
CITATION
COF
CRFIH
DGEBU
DKSSO
DMQIW
EAP
EDO
EMK
EPL
EST
ESX
E~A
E~B
GTTXZ
HF~
H~9
H~P
IPNFZ
J.P
KYCEM
LJTGL
M4Z
MK~
QCRFL
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TEJ
TFT
TTHFI
TUROJ
TUS
TWF
UT5
UU3
ZGOLN
~S~
ID FETCH-LOGICAL-c296t-40e285d411c5476a3c66a622d8124f5668b60c32e8a0ceba7f2dc1486de7e53d3
IEDL.DBID TFW
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1080_00207167708803124&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-7160
IngestDate Sat Nov 29 02:21:20 EST 2025
Tue Nov 18 21:58:46 EST 2025
Mon Oct 20 23:37:05 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c296t-40e285d411c5476a3c66a622d8124f5668b60c32e8a0ceba7f2dc1486de7e53d3
PageCount 29
ParticipantIDs crossref_citationtrail_10_1080_00207167708803124
crossref_primary_10_1080_00207167708803124
informaworld_taylorfrancis_310_1080_00207167708803124
PublicationCentury 1900
PublicationDate 1/1/1977
1977-01-00
PublicationDateYYYYMMDD 1977-01-01
PublicationDate_xml – month: 01
  year: 1977
  text: 1/1/1977
  day: 01
PublicationDecade 1970
PublicationTitle International journal of computer mathematics
PublicationYear 1977
Publisher Gordon and Breach Science Publishers
Publisher_xml – name: Gordon and Breach Science Publishers
References Hartmanis J. (CIT0002) 1965
Savitch W. J. (CIT0004) 1970; 4
Cook S. A. (CIT0001) 1971; 18
Hopcroft J. E. (CIT0003) 1969
References_xml – volume: 4
  start-page: 177
  year: 1970
  ident: CIT0004
  publication-title: J. Comput. System Sci.
  doi: 10.1016/S0022-0000(70)80006-X
– volume-title: Formal Languages and Their Relation to Automata
  year: 1969
  ident: CIT0003
– start-page: 179
  volume-title: IEEE Conference Record on Switching Theory and Logical Design
  year: 1965
  ident: CIT0002
– volume: 18
  start-page: 4
  year: 1971
  ident: CIT0001
  publication-title: J. ACM.
  doi: 10.1145/321623.321625
SSID ssj0008976
Score 1.2204351
Snippet 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...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 3
SubjectTerms auxiliary PDM
non-deterministic algorithm
recursive algorithm
stack machine
tape complexity
time complexity
Turing machine
Title Recursive turing machines
URI https://www.tandfonline.com/doi/abs/10.1080/00207167708803124
Volume 6
WOSCitedRecordID wos10_1080_00207167708803124&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis
  customDbUrl:
  eissn: 1029-0265
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008976
  issn: 0020-7160
  databaseCode: TFW
  dateStart: 19640101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB5k8eDF9Ynrix48CYE2bZL2KGLxtIisuLeSJwi6yrb6-82kD3ZFPeh9UtJ0kvlm-mU-gAuP-KXOMkuyRMXE41tDcmcY8ektw1zbCOGC2ISYTvP5vLjruDl1R6vEHNq1jSLCWY2bW6q6Z8ThDW4fGLkQfod4n6TYDdSjeiT0zcrH4RzOiyAth9bEmw__NL97wlpUWutZuhJtyvE_57kD2x3MjK5av9iFDbvYg3Ev4RB1O3ofJvdYb0cKe9SEC4vRS2BX2voAHsqb2fUt6dQSiKYFb3wiaGnOTJYkmmWCy1RzLjmlBkO486gtVzzWKbW5jLVVUjhqtF82bqywLDXpIYwWrwt7BJFSHnRoyVCIPFPOqMKlhtpYGGSjmmQCcb9ale5aiaOixXOVDB1Hv7z6BC6HIW9tH43fjNnqJ6iaULxwrdJIlf447viP405gK_E4uK2snMKoWb7bM9jUH81TvTwPXvUJwOjFhg
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60CnqxPrE-c_AkLCSbzW5yFLFUrEWkYm8h-wJBq7TR3-_OJg2tqAe974Q8Zna-bzI7H8CZQ_yFYswQFsmQOHyrSWp1Qhy9TZBrayGsF5sQg0E6GmV3dcFtWrdVIoe21aAIv1djcGMxetYSh0e4XWbkQrgQcU5J2TKsoDIdkq9h97HZidPMi8vhcuLWN381v7vEQl5amFo6l2-67f_e6SZs1EgzuKhcYwuWzHgb2jMVh6AO6h3o3GPJHbvYg9KfWQxefIOlme7CQ_dqeNkjtWACUTTjpeOChqaJZlGkEiZ4ESvOC06pxixuHXBLJQ9VTE1ahMrIQliqleNDXBthkljHe9Aav47NPgRSOtyhigS1yJm0WmY21tSEQmNDqo46EM5eV67qaeIoavGcR83Q0S-P3oHzxuStGqXx2-Jk_hvkpa9f2EpsJI9_tDv4o90prPWGt_28fz24OYT1yMHiqtByBK1y8m6OYVV9lE_TyYl3sU9YNsmp
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60inixPrE-c_AkLCSbfSRHUYOilCIVewvZFwgaSxv9_e5u0tCKetD7TshjZuebybfzAZxZxF9IQjQikQiRxbcKJUZRZMtb6mptxbnxYhO8309Go3TQcHOmDa3S1dCmHhTh92oX3GNlZow4d4LbJkbGuY0Q65OYLMOKhc3UOfUwe2o34iT12nJuObLr25-a311iIS0tDC2dSzdZ9583ugkbDc4MLmrH2IIlXW5Dd6bhEDQhvQO9B9dwdxz2oPInFoNXT6_U0114zK6HlzeokUtAEqesspWgxglVJIokJZwVsWSsYBgrl8ONhW2JYKGMsU6KUGpRcIOVtNUQU5prGqt4DzrlW6n3IRDCog5ZUKdEToRRIjWxwjrkytFRVdSDcPa2ctnMEneSFi951I4c_fLoPThvTcb1II3fFtP5T5BXvnthaqmRPP7R7uCPdqewNrjK8vvb_t0hrEcWE9ddliPoVJN3fQyr8qN6nk5OvIN9Ahd9yFs
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Recursive+turing+machines&rft.jtitle=International+journal+of+computer+mathematics&rft.au=Savitch%2C+Walter+J.&rft.date=1977-01-01&rft.pub=Gordon+and+Breach+Science+Publishers&rft.issn=0020-7160&rft.eissn=1029-0265&rft.volume=6&rft.issue=1&rft.spage=3&rft.epage=31&rft_id=info:doi/10.1080%2F00207167708803124&rft.externalDocID=8803124
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7160&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7160&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7160&client=summon