{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T20:33:01Z","timestamp":1767299581542},"reference-count":6,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1967,7,1]],"date-time":"1967-07-01T00:00:00Z","timestamp":-79056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T00:00:00Z","timestamp":1400112000000},"content-version":"vor","delay-in-days":17120,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1967,7]]},"DOI":"10.1016\/s0019-9958(67)90433-0","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T06:51:40Z","timestamp":1103093500000},"page":"138-146","source":"Crossref","is-referenced-by-count":9,"title":["Turing machines with a schedule to keep"],"prefix":"10.1016","volume":"11","author":[{"given":"Patrick C.","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(67)90433-0_bib1","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321296.321308","article-title":"On formalisms for Turing machines","volume":"12","author":"Fischer","year":"1965","journal-title":"J. Assoc. Comp. Mach."},{"key":"10.1016\/S0019-9958(67)90433-0_bib2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/S0019-9958(67)90433-0_bib3","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/321356.321362","article-title":"Two-tape simulation of multitape Turing machines","volume":"13","author":"Hennie","year":"1966","journal-title":"J. Assoc. Comp. Mach."},{"key":"10.1016\/S0019-9958(67)90433-0_bib4","unstructured":"Meyer, A R. (unpublished paper)."},{"key":"10.1016\/S0019-9958(67)90433-0_bib5","series-title":"Proceedings of the Sixth Annual Symposium on Switching Circuit Theory and Logical Design","first-page":"173","article-title":"Translational methods and computational complexity","author":"Ruby","year":"1965"},{"key":"10.1016\/S0019-9958(67)90433-0_bib6","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1109\/TEC.1962.5219459","article-title":"Real-time computation and recursive functions not real-time computable","volume":"EC-11","author":"Yamada","year":"1962","journal-title":"IRE Trans. Electronic Computers"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995867904330?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995867904330?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T14:53:34Z","timestamp":1548946414000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995867904330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1967,7]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1967,7]]}},"alternative-id":["S0019995867904330"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(67)90433-0","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1967,7]]}}}