{"id":"https://openalex.org/W2040277600","doi":"https://doi.org/10.1016/s1571-0661(03)00005-7","title":"Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH","display_name":"Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH","publication_year":2003,"publication_date":"2003-11-01","ids":{"openalex":"https://openalex.org/W2040277600","doi":"https://doi.org/10.1016/s1571-0661(03)00005-7","mag":"2040277600"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(03)00005-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(03)00005-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(03)00005-7","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067372819","display_name":"Olivier Bournez","orcid":"https://orcid.org/0000-0002-9218-1130"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I4210127166","display_name":"Centre Inria de l'Universit\u00e9 de Lorraine","ror":"https://ror.org/03fcjvn64","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210127166"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Olivier Bournez","raw_affiliation_strings":["LORIA/INRIA, 615 rue du Jardin Botanique, BP 101, 54602 Villers-l\u00e8s-Nancy Cedex, Nancy, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LORIA/INRIA, 615 rue du Jardin Botanique, BP 101, 54602 Villers-l\u00e8s-Nancy Cedex, Nancy, France","institution_ids":["https://openalex.org/I4210127166","https://openalex.org/I1326498283","https://openalex.org/I4210121838"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079608792","display_name":"Felipe Cucker","orcid":"https://orcid.org/0000-0002-4569-3248"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Felipe Cucker","raw_affiliation_strings":["Department of Mathematics, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong","Department of Mathematics, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Department of Mathematics, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong#TAB#","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084478376","display_name":"Paulin Jacob\u00e9 de Naurois","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I4210127166","display_name":"Centre Inria de l'Universit\u00e9 de Lorraine","ror":"https://ror.org/03fcjvn64","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210127166"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Paulin Jacob\u00e9 de Naurois","raw_affiliation_strings":["LORIA/INRIA, 615 rue du Jardin Botanique, BP 101, 54602 Villers-l\u00e8s-Nancy Cedex, Nancy, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LORIA/INRIA, 615 rue du Jardin Botanique, BP 101, 54602 Villers-l\u00e8s-Nancy Cedex, Nancy, France","institution_ids":["https://openalex.org/I4210127166","https://openalex.org/I1326498283","https://openalex.org/I4210121838"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106028817","display_name":"Jean-Yves Marion","orcid":"https://orcid.org/0009-0002-8262-3887"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I4210127166","display_name":"Centre Inria de l'Universit\u00e9 de Lorraine","ror":"https://ror.org/03fcjvn64","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210127166"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Jean-Yves Marion","raw_affiliation_strings":["LORIA/INRIA, 615 rue du Jardin Botanique, BP 101, 54602 Villers-l\u00e8s-Nancy Cedex, Nancy, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LORIA/INRIA, 615 rue du Jardin Botanique, BP 101, 54602 Villers-l\u00e8s-Nancy Cedex, Nancy, France","institution_ids":["https://openalex.org/I4210127166","https://openalex.org/I1326498283","https://openalex.org/I4210121838"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5067372819","https://openalex.org/A5079608792","https://openalex.org/A5084478376","https://openalex.org/A5106028817"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I168719708","https://openalex.org/I4210121838","https://openalex.org/I4210127166"],"apc_list":null,"apc_paid":null,"fwci":0.364,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61062183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"90","issue":null,"first_page":"3","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.683540940284729},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.5759868025779724},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.5562992691993713},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.540228009223938},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.5298236012458801},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5236132740974426},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5224746465682983},{"id":"https://openalex.org/keywords/ph","display_name":"PH","score":0.4964807629585266},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4927199184894562},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4720799922943115},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4582083225250244},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4340084195137024},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4030757248401642},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3644682765007019},{"id":"https://openalex.org/keywords/quantum-complexity-theory","display_name":"Quantum complexity theory","score":0.28503990173339844},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2676989734172821}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.683540940284729},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.5759868025779724},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.5562992691993713},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.540228009223938},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5298236012458801},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5236132740974426},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5224746465682983},{"id":"https://openalex.org/C122806257","wikidata":"https://www.wikidata.org/wiki/Q1063380","display_name":"PH","level":5,"score":0.4964807629585266},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4927199184894562},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4720799922943115},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4582083225250244},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4340084195137024},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4030757248401642},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3644682765007019},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.28503990173339844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2676989734172821},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s1571-0661(03)00005-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(03)00005-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/18b448e0-d147-49ae-bac5-ba5f6563ae6b","is_oa":true,"landing_page_url":"https://hdl.handle.net/2031/18b448e0-d147-49ae-bac5-ba5f6563ae6b","pdf_url":"https://scholars.cityu.edu.hk/files/86002263/5141837.pdf","source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bournez, O, Cucker, F, De Naurois, P J & Marion, J-Y 2003, 'Safe Recursion Over an Arbitrary Structure : PAR, PH and DPH', Electronic Notes in Theoretical Computer Science, vol. 90, pp. 3-14. https://doi.org/10.1016/S1571-0661(03)00005-7","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.718.9920","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.718.9920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lix.polytechnique.fr/%7Ebournez/load/Papier-ICC-2003.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00099619v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00099619","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fifth International Workshop on Implicit Computational Complexity - ICC'2003, Jun 2003, Ottawa, Canada, 13 p","raw_type":"Conference papers"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(03)00005-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(03)00005-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.41999998688697815}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309893","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W108460724","https://openalex.org/W596942210","https://openalex.org/W636367345","https://openalex.org/W1482193060","https://openalex.org/W1505951678","https://openalex.org/W1520244229","https://openalex.org/W1533996603","https://openalex.org/W1548852834","https://openalex.org/W1550331971","https://openalex.org/W1566708570","https://openalex.org/W1581416890","https://openalex.org/W1708892819","https://openalex.org/W1981324778","https://openalex.org/W2001022561","https://openalex.org/W2045916776","https://openalex.org/W2059913973","https://openalex.org/W2069792094","https://openalex.org/W2071846104","https://openalex.org/W2074466497","https://openalex.org/W2105438076","https://openalex.org/W2111235650","https://openalex.org/W2148868461","https://openalex.org/W3127113455","https://openalex.org/W4236835455","https://openalex.org/W6604469350","https://openalex.org/W6630329848","https://openalex.org/W6631174970","https://openalex.org/W6634822101","https://openalex.org/W6669087058","https://openalex.org/W6789738865","https://openalex.org/W6990738990","https://openalex.org/W7048286187"],"related_works":["https://openalex.org/W4294266235","https://openalex.org/W1504200807","https://openalex.org/W1520700928","https://openalex.org/W2574530711","https://openalex.org/W1560648968","https://openalex.org/W1980837654","https://openalex.org/W2798907744","https://openalex.org/W1999609654","https://openalex.org/W2461808546","https://openalex.org/W2289000419"],"abstract_inverted_index":{"Considering":[0],"the":[1,23,48,64,85,107],"Blum,":[2],"Shub,":[3],"and":[4,35,53,106],"Smale":[5],"computational":[6],"model":[7],"for":[8,59,89],"real":[9],"numbers,":[10],"extended":[11],"by":[12],"Poizat":[13],"to":[14,25,66,101,111,131],"general":[15,31],"structures,":[16,96],"classical":[17,60],"complexity":[18,36,61,92,124],"can":[19],"be":[20],"considered":[21],"as":[22],"restriction":[24,65],"finite":[26,67,132],"structures":[27,68],"of":[28,33,51,55,69,72,122],"a":[29,42,70],"more":[30],"notion":[32],"computability":[34],"working":[37],"over":[38,76,94],"arbitrary":[39,77,95],"structures.":[40,78,133],"In":[41,79],"previous":[43,127],"paper,":[44,81],"we":[45,82],"showed":[46],"that":[47,84],"machine-independent":[49,120],"characterization":[50,71],"Bellantoni":[52],"Cook":[54],"sequential":[56,73],"polynomial":[57,74,98,108],"time":[58,75,99],"is":[62],"actually":[63],"this":[80],"prove":[83],"same":[86],"phenomenon":[87],"happens":[88],"several":[90,123],"other":[91],"classes:":[93],"parallel":[97],"corresponds":[100,110],"safe":[102,112],"recursion":[103,113],"with":[104,114],"substitutions,":[105],"hierarchy":[109],"predicative":[115],"minimization.":[116],"Our":[117],"results":[118],"yield":[119],"characterizations":[121],"classes":[125],"subsuming":[126],"ones":[128],"when":[129],"restricted":[130]},"counts_by_year":[],"updated_date":"2026-05-17T08:19:37.847499","created_date":"2025-10-10T00:00:00"}