{"id":"https://openalex.org/W2092669229","doi":"https://doi.org/10.1137/0215059","title":"Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze","display_name":"Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze","publication_year":1986,"publication_date":"1986-08-01","ids":{"openalex":"https://openalex.org/W2092669229","doi":"https://doi.org/10.1137/0215059","mag":"2092669229"},"language":"en","primary_location":{"id":"doi:10.1137/0215059","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215059","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086835651","display_name":"Harry B. Hunt","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"H. B. Hunt, III","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5009388396","display_name":"Daniel J. Rosenkrantz","orcid":"https://orcid.org/0000-0002-7044-0197"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. J. Rosenkrantz","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086835651"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17850786,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"3","first_page":"831","last_page":"850"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9988999962806702,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9988999962806702,"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.8473570942878723},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6779037714004517},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5225674510002136},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5149210691452026},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.4830092191696167},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.44260966777801514},{"id":"https://openalex.org/keywords/double-recursion","display_name":"Double recursion","score":0.4326880872249603},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42887449264526367},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3996887803077698},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38526105880737305},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08751338720321655}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8473570942878723},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6779037714004517},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5225674510002136},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5149210691452026},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.4830092191696167},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.44260966777801514},{"id":"https://openalex.org/C139503435","wikidata":"https://www.wikidata.org/wiki/Q5300083","display_name":"Double recursion","level":3,"score":0.4326880872249603},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42887449264526367},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3996887803077698},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38526105880737305},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08751338720321655},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0215059","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215059","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W109993195","https://openalex.org/W1572219859","https://openalex.org/W1655990431","https://openalex.org/W1978995933","https://openalex.org/W1988826480","https://openalex.org/W2010927194","https://openalex.org/W2013008477","https://openalex.org/W2016313399","https://openalex.org/W2018379587","https://openalex.org/W2024886091","https://openalex.org/W2079275582","https://openalex.org/W2092518806","https://openalex.org/W4232260294"],"related_works":["https://openalex.org/W2584778959","https://openalex.org/W2286072184","https://openalex.org/W2074941524","https://openalex.org/W4246540581","https://openalex.org/W1845597072","https://openalex.org/W1596057910","https://openalex.org/W2006836388","https://openalex.org/W1505802359","https://openalex.org/W4244779119","https://openalex.org/W2095450548"],"abstract_inverted_index":{"Deterministic":[0],"exponential":[1],"lower":[2,15,40,60],"time":[3,61],"bounds":[4,16,41,62],"are":[5],"presented":[6],"for":[7,17,21,42,46,64],"analyzing":[8],"recursion":[9,18],"schemes":[10,19],"and":[11,73],"recursive":[12,43,52],"programs.":[13],"The":[14,39],"hold":[20,45,63],"any":[22,51],"interpretation":[23],"with":[24,55],"a":[25,29,56],"nontrivial":[26,57],"predicate,":[27],"i.e.":[28],"predicate":[30],"that":[31],"is":[32],"neither":[33],"identically":[34,37],"true":[35],"nor":[36],"false.":[38],"programs":[44,49],"very":[47],"simple":[48],"in":[50],"programming":[53],"language":[54],"predicate.":[58],"These":[59],"the":[65],"executability,":[66],"computational":[67],"identity,":[68],"totality,":[69],"divergence,":[70],"partial":[71],"correctness,":[72],"total":[74],"correctness":[75],"problems.":[76]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}