{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T13:11:07Z","timestamp":1759497067969},"reference-count":9,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1971,12,1]],"date-time":"1971-12-01T00:00:00Z","timestamp":60393600000},"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":15205,"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":[[1971,12]]},"DOI":"10.1016\/s0019-9958(71)90651-6","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"377-386","source":"Crossref","is-referenced-by-count":6,"title":["A note on \u201caxioms\u201d for computational complexity and computation of finite functions"],"prefix":"10.1016","volume":"19","author":[{"given":"Paul D.","family":"Young","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(71)90651-6_bib1","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. Comp. Mach."},{"key":"10.1016\/S0019-9958(71)90651-6_bib2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0019-9958(67)90546-3","article-title":"On the size of machines","volume":"11","author":"Blum","year":"1967","journal-title":"Information and Control"},{"key":"10.1016\/S0019-9958(71)90651-6_bib3","series-title":"Preliminary report, ACM Symposium on Theory of Computing","first-page":"79","article-title":"Classes of Computable Functions Defined by Bounds on Computation","author":"McCreight","year":"1969"},{"key":"10.1016\/S0019-9958(71)90651-6_bib4","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1016\/S0019-9958(69)90323-4","article-title":"On finding programs of minimal length","volume":"15","author":"Pager","year":"1969","journal-title":"Information and Control"},{"key":"10.1016\/S0019-9958(71)90651-6_bib5","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1145\/321607.321619","article-title":"On the efficiency of algorithms","volume":"17","author":"Pager","year":"1970","journal-title":"J. Assoc. Comp. Mach."},{"key":"10.1016\/S0019-9958(71)90651-6_bib6","unstructured":"Pager, David, On finding the shortest program for a decision table, to appear."},{"key":"10.1016\/S0019-9958(71)90651-6_bib7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02759719","article-title":"Real time computation","volume":"1","author":"Rabin","year":"1963","journal-title":"Israel J. Math."},{"key":"10.1016\/S0019-9958(71)90651-6_bib8","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1145\/321510.321525","article-title":"Toward a theory of enumerations","volume":"16","author":"Young","year":"1969","journal-title":"J. Assoc. Comp. Mach."},{"key":"10.1016\/S0019-9958(71)90651-6_bib9","first-page":"1","article-title":"Computational Speed-up by Table Look-ups","author":"Young","year":"1968"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995871906516?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995871906516?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:50:09Z","timestamp":1548946209000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995871906516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,12]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1971,12]]}},"alternative-id":["S0019995871906516"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(71)90651-6","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1971,12]]}}}