{"doi":"10.1007/3-540-45833-6_1","title":"The Complexity of Real Recursive Functions","abstract":null,"journal":"Lecture Notes in Computer Science","year":2002,"id":26629,"datarank":1.4671579590738388,"base_score":3.367295829986474,"endowment":3.367295829986474,"self_citation_contribution":0.5050943744979712,"citation_network_contribution":0.9620635845758675,"self_endowment_contribution":0.5050943744979712,"citer_contribution":0.9620635845758675,"corpus_percentile":null,"corpus_rank":null,"citation_count":28,"citer_count":21,"citers_with_citation_signal":19,"citers_with_endowment":19,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":153603,"name":"Manuel Lameiras Campagnolo","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":3.367295829986474,"endowment":3.367295829986474,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"42232042","pmcid":null,"openalex_id":"https://openalex.org/W1596057910","authors":[],"funders":[],"total_grants":0,"fwci":4.3192,"citation_percentile":0.94480732,"influential_citations":3,"citation_trend":[{"year":2020,"count":1},{"year":2021,"count":1},{"year":2023,"count":1},{"year":2024,"count":1}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://www.cs.math.ist.utl.pt/ftp/pub/CampagnoloM/02-C-realrec.pdf","host_type":"GREEN"},{"url":"http://link.springer.com/content/pdf/10.1007/3-540-45833-6_1","host_type":"publisher"},{"url":"https://doi.org/10.1007/3-540-45833-6_1","host_type":"book series"},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.1698","host_type":""},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.7845","host_type":""}],"fields_of_study":["Computability, Logic, AI Algorithms","semigroups and automata theory","Logic, programming, and type systems","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Recursion (computer science)","μ operator","Primitive recursive function","Recursive functions","Double recursion","Mutual recursion","Computability theory","Computer science","Complexity class","Function (biology)","Algebra over a field","Mathematics","Computational complexity theory","Discrete mathematics","Algorithm","Theoretical computer science","Pure mathematics","Uniportal video-assisted thoracoscopic surgery (uniportal VATS)","anatomical segmentectomy","bronchial marking","indocyanine green (ICG)","vein-first dissection"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T15:04:18.691293Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}