{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:23Z","timestamp":1750307663014,"version":"3.41.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2009,8]]},"abstract":"<jats:p>Bellantoni and Cook have given a function-algebra characterization of the polynomial-time computable functions via an unbounded recursion scheme which is called safe recursion. Inspired by their work, we characterize the exponential-time computable functions with the use of a safe variant of nested recursion.<\/jats:p>","DOI":"10.1145\/1555746.1555748","type":"journal-article","created":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T13:29:23Z","timestamp":1249997363000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A new function algebra of EXPTIME functions by safe nested recursion"],"prefix":"10.1145","volume":"10","author":[{"given":"Toshiyasu","family":"Arai","sequence":"first","affiliation":[{"name":"Kobe University, Kobe, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naohi","family":"Eguchi","sequence":"additional","affiliation":[{"name":"Kobe University, Kobe, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,8,14]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Bellantoni S. 1992. Predicative recursion and computational complexity. Ph.D. thesis University of Toronto.   Bellantoni S. 1992. Predicative recursion and computational complexity. Ph.D. thesis University of Toronto."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01201998"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645682.664421"},{"volume-title":"Handbook of Computability Theory, Studies in the Logical Foundations of Mathematics","author":"Clote P.","key":"e_1_2_1_4_1"},{"volume-title":"Proceedings of the Inter. Congress on Logic, Methodology and Philosophy of Science. North Holland","year":"1965","author":"Cobham A.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Handley W. G. and Wainer S. S. 1999. Complexity of primitive recursion. In Computational Logic NATO ASI Series F: Computer Systems Science U. Berger and H. Schwichtenberg Eds. vol. 165. Springer 273--300.  Handley W. G. and Wainer S. S. 1999. Complexity of primitive recursion. In Computational Logic NATO ASI Series F: Computer Systems Science U. Berger and H. Schwichtenberg Eds. vol. 165. Springer 273--300.","DOI":"10.1007\/978-3-642-58622-4_8"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1963-0158822-2"},{"volume-title":"Subrecursion: Functions and Hierarchies","year":"1984","author":"Rose H. E.","key":"e_1_2_1_8_1"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1555746.1555748","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1555746.1555748","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:31Z","timestamp":1750253371000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1555746.1555748"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["10.1145\/1555746.1555748"],"URL":"https:\/\/doi.org\/10.1145\/1555746.1555748","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2009,8]]},"assertion":[{"value":"2006-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}