{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:53Z","timestamp":1725662873980},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540089216"},{"type":"electronic","value":"9783540357575"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08921-7_70","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:36:12Z","timestamp":1330187772000},"page":"232-238","source":"Crossref","is-referenced-by-count":4,"title":["Loop programs and classes of primitive recursive functions"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Goetze","sequence":"first","affiliation":[]},{"given":"Werner","family":"Nehrlich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/malq.19630092202","volume":"9","author":"J. P. Cleave","year":"1963","unstructured":"Cleave, J.P., A hierarchy of primitive recursive functions, Zeitschrift f. math. Logik u. Grundl. d. Math. 9, (1963) 331\u2013345.","journal-title":"Zeitschrift f. math. Logik u. Grundl. d. Math."},{"key":"19_CR2","volume-title":"Bar-Hillel \"Logic, Method. and Phil. of Science\"","author":"A. Cobham","year":"1965","unstructured":"Cobham, A., The intrinsic computational difficulty of functions in: Bar-Hillel \"Logic, Method. and Phil. of Science\", North-Holland, Amsterdam, 1965."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/321707.321721","volume":"19","author":"R. L. Constable","year":"1972","unstructured":"Constable, R.L. and Borodin, A., Subrecursive programming languages, part I: Efficiency and program structure, JACM 19, (1972) 526\u2013568.","journal-title":"JACM"},{"key":"19_CR4","unstructured":"Goetze, B.G. and Nehrlich, W., LOOP-Programme und subrekursive Funktionenklassen, preprint."},{"key":"19_CR5","first-page":"1","volume":"4","author":"A. Grzegorczyk","year":"1953","unstructured":"Grzegorczyk, A., Some classes of recursive functions, Rozprawy Matematiczne 4 (1953) 1\u201344.","journal-title":"Rozprawy Matematiczne"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Mc.Creight, E.M. and Meyer, A.R., Classes of computable functions defined by bounds on computations: preliminary report Conf. Rec. ACM, Symp. on Theory of Computing, 1969, 79\u201388.","DOI":"10.1145\/800169.805423"},{"key":"19_CR7","first-page":"342","volume":"12","author":"A. R. Meyer","year":"1965","unstructured":"Meyer, A.R., Depth of Nesting and the Grzegorczyk-Hierarchie, Notices AMS 12 (1965) p. 342","journal-title":"Notices AMS"},{"key":"19_CR8","unstructured":"Meyer, A.R. and Ritchie, D.M., Computational Complexity and Program Structure, Research paper RC \u2014 1817, 1967"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1978"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08921-7_70.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:23Z","timestamp":1605643223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08921-7_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540089216","9783540357575"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-08921-7_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1978]]}}}