{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T09:39:56Z","timestamp":1698485996742},"reference-count":19,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,11,13]],"date-time":"2006-11-13T00:00:00Z","timestamp":1163376000000},"content-version":"vor","delay-in-days":11274,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[1976,1]]},"DOI":"10.1002\/malq.19760220156","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T02:57:48Z","timestamp":1180148268000},"page":"441-480","source":"Crossref","is-referenced-by-count":2,"title":["The Vectorized Grzegorczyk Hierarchy"],"prefix":"10.1002","volume":"22","author":[{"given":"Steven S.","family":"Muchnick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,11,13]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"24","volume-title":"Methodology and the Philosophy of Science","author":"Cobham Alan","year":"1965"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(72)80029-1"},{"key":"e_1_2_1_4_2","volume-title":"Computability and Unsolvability","author":"Davis Martin","year":"1958"},{"key":"e_1_2_1_5_2","first-page":"4","article-title":"Some classes of recursive functions","volume":"4","author":"Grzegorczyk Andrej","year":"1953","journal-title":"Rozprawy Matematyczne"},{"key":"e_1_2_1_6_2","volume-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft John E.","year":"1969"},{"key":"e_1_2_1_7_2","first-page":"53","article-title":"Mnogokratniye rekursi\u0144, ograni\u010denniye v klasse primitivno rekursivniyx funktsii (Limited multiple recursion in classes of primitive recursive functions)","volume":"6","author":"Mar\u010denkov S. S.","year":"1970","journal-title":"Kibernetika (Cybernetics)"},{"key":"e_1_2_1_8_2","first-page":"561","article-title":"Ustranenie sxem rekursi\u0144 v klasse g2 G\u017eergor\u010dika (Elimination of recursion schemes in the Grzegorczyk class g2)","volume":"5","author":"Mar\u010denkov S. S.","year":"1969","journal-title":"Matemati\u010deskie Zametki (Mathematical Notices)"},{"key":"e_1_2_1_9_2","unstructured":"Meyer Albert R. andDennis M.Ritchie Computational complexity and program structure. IBM Research Paper RC\u20101817 May1967."},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"Miller Gary L. Riemann's Hypothesis and tests for primality. Proceedings of the Seventh Annual ACM Symposium on Theory of Computing May1975 234\u2013239.","DOI":"10.1145\/800116.803773"},{"key":"e_1_2_1_11_2","unstructured":"Moll Robert Complexity Classes of Recursive Functions. Project MAC Report TR\u2010110 Massachusetts Institute of Technology June1973."},{"key":"e_1_2_1_12_2","first-page":"14","article-title":"Characterization of the elementary functions in terms of depth of nesting of primitive recursions","volume":"5","author":"M\u00fcller Helmut","year":"1973","journal-title":"Recursive Function Theory: Newsletter"},{"key":"e_1_2_1_13_2","volume-title":"Rekursive Funktionen","author":"P\u00e9ter R\u00f3zsa","year":"1951"},{"key":"e_1_2_1_14_2","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 Robert W.","year":"1963","journal-title":"Trans. Amer. Math. Soc."},{"key":"e_1_2_1_15_2","volume-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers Hartley","year":"1967"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(71)90002-0"},{"key":"e_1_2_1_17_2","unstructured":"Tsichritzis D. andP.Weiner Some unsolvable problems and partial solutions. Technical Report 69 Department of Electrical Engineering Princeton University July1968."},{"key":"e_1_2_1_18_2","unstructured":"Warkentin John C. Grzegorczyk classes from a single operation unpublished manuscript 1971."},{"key":"e_1_2_1_19_2","unstructured":"Warkentin John C. Small Classes of Recursive Functions and Relations Ph. D. dissertation Research Report CSRR 2052 Department of Applied Analysis and Computer Science University of Waterloo Oct.1971."},{"key":"e_1_2_1_20_2","doi-asserted-by":"crossref","unstructured":"Warkentin John C. andPatrick C.Fischer Predecessor machines and regressing functions. Proceedings of the 4th Annual ACM Symposium on Theory of Computing May1972 81\u201387.","DOI":"10.1145\/800152.804899"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.19760220156","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.19760220156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T14:40:06Z","timestamp":1697726406000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.19760220156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,1]]}},"alternative-id":["10.1002\/malq.19760220156"],"URL":"https:\/\/doi.org\/10.1002\/malq.19760220156","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,1]]}}}