{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:30:41Z","timestamp":1720625441747},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3558,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s1571-0661(03)00005-7","type":"journal-article","created":{"date-parts":[[2003,12,2]],"date-time":"2003-12-02T07:09:41Z","timestamp":1070348981000},"page":"3-14","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH"],"prefix":"10.1016","volume":"90","author":[{"given":"Olivier","family":"Bournez","sequence":"first","affiliation":[]},{"given":"Felipe","family":"Cucker","sequence":"additional","affiliation":[]},{"given":"Paulin Jacob\u00e9","family":"de Naurois","sequence":"additional","affiliation":[]},{"given":"Jean-Yves","family":"Marion","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(03)00005-7_BIB001","series-title":"Feasible Mathematics II","article-title":"Predicative recursion and the polytime hierarchy","author":"Bellantoni","year":"1994"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB002","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01201998","article-title":"A new recursion-theoretic characterization of the poly-time functions","volume":"2","author":"Bellantoni","year":"1992","journal-title":"Computational Complexity"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB003","series-title":"Complexity and Real Computation","author":"Blum","year":"1998"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","article-title":"On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines","volume":"21","author":"Blum","year":"1989","journal-title":"Bulletin of the American Mathematical Society"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB005","first-page":"185","article-title":"Safe recursion over an arbitrary structure. sequential and parallel polynomial time","volume":"2620","author":"Bournez","year":"2003"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB006","unstructured":"Olivier Bournez, Paulin Jacob\u00e9 de Naurois and Jean-Yves Marion Safe recursion and calculus over an arbitrary structure. In Implicit Computational Complexity, ICC 2002, Copenhagen, Denmark, 20-21 June 2002"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB007","first-page":"98","article-title":"Computational models and function algebras","volume":"960","author":"Clote","year":"1995"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB008","series-title":"Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science","first-page":"24","article-title":"The intrinsic computational difficulty of functions","author":"Cobham","year":"1962"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB009","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03182-7_6","article-title":"Finite Model Theory","author":"Ebbinghaus","year":"1995"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB010","series-title":"Complexity of Computation","first-page":"43","article-title":"Generalized first order spectra and polynomial time recognizable sets","author":"Fagin","year":"1974"},{"issue":"1","key":"10.1016\/S1571-0661(03)00005-7_BIB011","doi-asserted-by":"crossref","first-page":"92","DOI":"10.2307\/2275252","article-title":"Accessible telephone directories","volume":"59","author":"Goode","year":"1994","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"10.1016\/S1571-0661(03)00005-7_BIB012","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/inco.1997.2675","article-title":"Metafinite model theory","volume":"140","author":"Gr\u00e4del","year":"1998","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB013","doi-asserted-by":"crossref","unstructured":"Erich Gr\u00e4del and Klaus Meer. Descriptive complexity theory over the real numbers. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 315\u2013324, Las Vegas, Nevada, 29 May\u20131 June 1995","DOI":"10.1145\/225058.225151"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB014","first-page":"210","article-title":"Algebras of feasible functions","author":"Gurevich","year":"1983"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB015","unstructured":"M. Hofmann. Type systems for polynomial-time computation, 1999. Habilitation"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB016","series-title":"Descriptive Complexity","author":"Immerman","year":"1999"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB017","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1017\/S0956796800003889","article-title":"The expressive power of higher order types","volume":"11","author":"Jones","year":"2001","journal-title":"J. of Functional Programming"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB018","first-page":"177","article-title":"Intrinsic theories and computational complexity","volume":"960","author":"Leivant","year":"1995"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB019","first-page":"369","article-title":"Ramified recurrence and computational complexity II: substitution and poly-space","volume":"933","author":"Leivant","year":"1995"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB020","first-page":"25","article-title":"Efficient first order functional program interpreter with time bound certifications","volume":"1955","author":"Marion","year":"2000"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB021","first-page":"435","article-title":"Une remarque \u00e0 propos des machines sur R introduites par Blum, Shub et Smale","volume":"309","author":"Michaux","year":"1989","journal-title":"C. R. Acad. Sci. Paris S\u00e9rie I"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB022","series-title":"Les Petits Cailloux","author":"Poizat","year":"1995"},{"key":"10.1016\/S1571-0661(03)00005-7_BIB023","first-page":"319","article-title":"Polynomial computability and recursivity in finite domains","volume":"7","author":"Sazonov","year":"1980","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066103000057?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066103000057?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T11:54:48Z","timestamp":1550318088000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066103000057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":23,"alternative-id":["S1571066103000057"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(03)00005-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}