{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T15:59:31Z","timestamp":1768579171469,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1973,8,1]],"date-time":"1973-08-01T00:00:00Z","timestamp":113011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":14595,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1973,8]]},"DOI":"10.1016\/s0022-0000(73)80029-7","type":"journal-article","created":{"date-parts":[[2008,3,25]],"date-time":"2008-03-25T04:09:39Z","timestamp":1206418179000},"page":"354-375","source":"Crossref","is-referenced-by-count":188,"title":["Time bounded random access machines"],"prefix":"10.1016","volume":"7","author":[{"given":"Stephen A.","family":"Cook","sequence":"first","affiliation":[]},{"given":"Robert A.","family":"Reckhow","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(73)80029-7_bib1","article-title":"Diagonal Theorems for Random Access Machines","author":"Cook","year":"1972"},{"key":"10.1016\/S0022-0000(73)80029-7_bib2","unstructured":"Stephen A. Cook, Linear Time Simulation of Deterministic Two-way Pushdown Automata, Proceedings of IFIP Congress 71, Foundations of Information Processing."},{"key":"10.1016\/S0022-0000(73)80029-7_bib3","doi-asserted-by":"crossref","unstructured":"Peter Naur (ed.), Revised Report on the Algorithmic Language ALGOL 60, C.A.C.M. 6, 1 (1963), 1\u201317.","DOI":"10.5107\/sccj1963.1.1"},{"issue":"3","key":"10.1016\/S0022-0000(73)80029-7_bib4","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01694180","article-title":"Computational complexity of random access stored program machines","volume":"5","author":"Hartmanis","year":"1971","journal-title":"Mathematical Systems Theory"},{"key":"10.1016\/S0022-0000(73)80029-7_bib5","author":"Hopcroft","year":"1969"},{"issue":"4","key":"10.1016\/S0022-0000(73)80029-7_bib6","first-page":"533","article-title":"Two-tape simulation of multi-tape turing machines","volume":"13","author":"Hennie","year":"1966","journal-title":"J.A.C.M."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000073800297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000073800297?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T06:19:26Z","timestamp":1684304366000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000073800297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,8]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1973,8]]}},"alternative-id":["S0022000073800297"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(73)80029-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1973,8]]}}}