{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:38:45Z","timestamp":1752230325378},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":12982,"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":[[1978,1]]},"DOI":"10.1016\/s0019-9958(78)90257-7","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T04:12:12Z","timestamp":1103083932000},"page":"102-117","source":"Crossref","is-referenced-by-count":14,"title":["The bounded arithmetic hierarchy"],"prefix":"10.1016","volume":"36","author":[{"given":"Keith","family":"Harrow","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(78)90257-7_bib1","series-title":"Number theoretic aspects of computational complexity","author":"Adleman","year":"1976"},{"key":"10.1016\/S0019-9958(78)90257-7_bib2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0019-9958(78)90257-7_bib3","article-title":"On Spectra","author":"Bennett","year":"1962"},{"key":"10.1016\/S0019-9958(78)90257-7_bib4","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine-independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(78)90257-7_bib5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01705890","article-title":"Quasi-realtime languages","volume":"4","author":"Book","year":"1970","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0019-9958(78)90257-7_bib6","series-title":"Computability and Unsolvability","author":"Davis","year":"1958"},{"key":"10.1016\/S0019-9958(78)90257-7_bib7","series-title":"On rudimentary languages","author":"Finkelstein","year":"1977"},{"key":"10.1016\/S0019-9958(78)90257-7_bib8","article-title":"Some classes of recursive functions","volume":"4","author":"Grzegorczyk","year":"1953","journal-title":"Rozprawy Mat."},{"key":"10.1016\/S0019-9958(78)90257-7_bib9","article-title":"Sub-elementary Classes of Functions and Relations","author":"Harrow","year":"1973"},{"key":"10.1016\/S0019-9958(78)90257-7_bib10","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1002\/malq.19750210157","article-title":"Small Grzegorczyk classes and limited minimum","volume":"11","author":"Harrow","year":"1975","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/S0019-9958(78)90257-7_bib11","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0019-9958(78)90257-7_bib12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(68)91096-6","article-title":"Classes of automata and transitive closure","volume":"13","author":"Jones","year":"1968","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(78)90257-7_bib13","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/BF01746515","article-title":"Context-free languages and rudimentary attributes","volume":"3","author":"Jones","year":"1969","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0019-9958(78)90257-7_bib14","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","article-title":"Space-bounded reducibility among combinatorial problems","volume":"11","author":"Jones","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(78)90257-7_bib15","series-title":"Proceedings of the IEEE Thirteenth Annual Symposium on Switching and Automata Theory","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972"},{"key":"10.1016\/S0019-9958(78)90257-7_bib16","article-title":"Linear Bounded Automata","author":"Myhill","year":"1960","journal-title":"WADD Technical Note 60-165"},{"key":"10.1016\/S0019-9958(78)90257-7_bib17","first-page":"43","article-title":"Rudimentary interpretation of two-tape Turing computation","volume":"2","author":"Nepomnyaschii","year":"1970","journal-title":"Kibernetika"},{"key":"10.1016\/S0019-9958(78)90257-7_bib18","first-page":"1462","article-title":"Rudimentary predicates and Turing computations","volume":"11","author":"Nepomnyaschii","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0019-9958(78)90257-7_bib19","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/S0002-9947-1963-0158822-2","article-title":"Classes of predictably computable functions","volume":"106","author":"Ritchie","year":"1963","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0019-9958(78)90257-7_bib20","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/S0019-9958(78)90257-7_bib21","series-title":"Theory of Formal Systems","author":"Smullyan","year":"1961"},{"key":"10.1016\/S0019-9958(78)90257-7_bib22","article-title":"The Polynomial-Time Hierarchy","author":"Stockmeyer","year":"1975","journal-title":"IBM Research Report RC 5379"},{"key":"10.1016\/S0019-9958(78)90257-7_bib23","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1145\/321510.321525","article-title":"Towards a theory of enumerations","volume":"16","author":"Young","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(78)90257-7_bib24","article-title":"Subrecursive Predicates and Automata","author":"Wrathall","year":"1975","journal-title":"Yale University Research Report No.56"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995878902577?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995878902577?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T09:20:08Z","timestamp":1548926408000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995878902577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,1]]}},"alternative-id":["S0019995878902577"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(78)90257-7","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1978,1]]}}}