On Families of Languages Defined by Time-Bounded Random Access Machines
From MaRDI portal
Publication:4128009
DOI10.1137/0205018zbMath0356.68058MaRDI QIDQ4128009
A. Zalcberg, Ivan Hal Sudborough
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0205018
Related Items
Tighter constant-factor time hierarchies, Indirect addressing and the time relationships of some models of sequential computation, Nonexistence of program optimizers in several abstract settings