{"id":"https://openalex.org/W2021017634","doi":"https://doi.org/10.1305/ndjfl/1107220673","title":"Program Size Complexity for Possibly Infinite Computations","display_name":"Program Size Complexity for Possibly Infinite Computations","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2021017634","doi":"https://doi.org/10.1305/ndjfl/1107220673","mag":"2021017634"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1107220673","is_oa":false,"landing_page_url":"https://doi.org/10.1305/ndjfl/1107220673","pdf_url":null,"source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","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/A5072436621","display_name":"Ver\u00f3nica Becher","orcid":"https://orcid.org/0000-0002-5425-8563"},"institutions":[{"id":"https://openalex.org/I24354313","display_name":"Universidad de Buenos Aires","ror":"https://ror.org/0081fs513","country_code":"AR","type":"education","lineage":["https://openalex.org/I24354313"]}],"countries":["AR"],"is_corresponding":false,"raw_author_name":"Ver\u00f3nica Becher","raw_affiliation_strings":["[University of Buenos Aires]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[University of Buenos Aires]","institution_ids":["https://openalex.org/I24354313"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082992052","display_name":"Santiago Figueira","orcid":"https://orcid.org/0000-0002-8055-397X"},"institutions":[{"id":"https://openalex.org/I24354313","display_name":"Universidad de Buenos Aires","ror":"https://ror.org/0081fs513","country_code":"AR","type":"education","lineage":["https://openalex.org/I24354313"]}],"countries":["AR"],"is_corresponding":false,"raw_author_name":"Santiago Figueira","raw_affiliation_strings":["[University of Buenos Aires]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[University of Buenos Aires]","institution_ids":["https://openalex.org/I24354313"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047690936","display_name":"Andr\u00e9 Nies","orcid":"https://orcid.org/0000-0002-0666-5180"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Nies","raw_affiliation_strings":["University of AUCKLAND"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of AUCKLAND","institution_ids":["https://openalex.org/I154130895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034254462","display_name":"Silvana Picchi","orcid":null},"institutions":[{"id":"https://openalex.org/I24354313","display_name":"Universidad de Buenos Aires","ror":"https://ror.org/0081fs513","country_code":"AR","type":"education","lineage":["https://openalex.org/I24354313"]}],"countries":["AR"],"is_corresponding":false,"raw_author_name":"Silvana Picchi","raw_affiliation_strings":["[University of Buenos Aires]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[University of Buenos Aires]","institution_ids":["https://openalex.org/I24354313"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9954,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86412751,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"46","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":1.0,"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":1.0,"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/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9904000163078308,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9714000225067139,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.6831468343734741},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.666093647480011},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6069421768188477},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.599903404712677},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5954241156578064},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5790271162986755},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5651114583015442},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5231334567070007},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.482326477766037},{"id":"https://openalex.org/keywords/triviality","display_name":"Triviality","score":0.454664409160614},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4535258412361145},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.4408091604709625},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43103471398353577},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4304611086845398},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42648348212242126},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4132382571697235},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.41033416986465454},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.29585695266723633},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20788687467575073},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19516050815582275},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.10764634609222412},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.10390612483024597},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07314038276672363}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.6831468343734741},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.666093647480011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6069421768188477},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.599903404712677},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5954241156578064},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5790271162986755},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5651114583015442},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5231334567070007},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.482326477766037},{"id":"https://openalex.org/C2778795013","wikidata":"https://www.wikidata.org/wiki/Q945127","display_name":"Triviality","level":2,"score":0.454664409160614},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4535258412361145},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.4408091604709625},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43103471398353577},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4304611086845398},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42648348212242126},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4132382571697235},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.41033416986465454},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29585695266723633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20788687467575073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19516050815582275},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.10764634609222412},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.10390612483024597},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07314038276672363},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1305/ndjfl/1107220673","is_oa":false,"landing_page_url":"https://doi.org/10.1305/ndjfl/1107220673","pdf_url":null,"source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1107220673","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1107220673","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.212.6980","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.6980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.glyc.dc.uba.ar/santiago/papers/hinf.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.4093","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.4093","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.auckland.ac.nz/~nies/papers/hinfinite.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.66.6049","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.6049","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.auckland.ac.nz/CDMTCS//researchreports/222andre.pdf","raw_type":"text"},{"id":"pmh:oai:researchspace.auckland.ac.nz:2292/3729","is_oa":false,"landing_page_url":"https://hdl.handle.net/2292/3729","pdf_url":null,"source":{"id":"https://openalex.org/S7407055463","display_name":"ResearchSpace (University of Auckland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I154130895","host_organization_name":"University of Auckland","host_organization_lineage":["https://openalex.org/I154130895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial","raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1542465977","https://openalex.org/W1638203394","https://openalex.org/W1659318463","https://openalex.org/W1997686864","https://openalex.org/W2020311636","https://openalex.org/W2029308360","https://openalex.org/W2032627084","https://openalex.org/W2045709959","https://openalex.org/W2054482276","https://openalex.org/W2067580807","https://openalex.org/W2100231900","https://openalex.org/W2571335838","https://openalex.org/W2614709548","https://openalex.org/W3124610789"],"related_works":["https://openalex.org/W2122747219","https://openalex.org/W1486286946","https://openalex.org/W4387774848","https://openalex.org/W4388215614","https://openalex.org/W1986583804","https://openalex.org/W1994605990","https://openalex.org/W2030492659","https://openalex.org/W2189193453","https://openalex.org/W2089690927","https://openalex.org/W1895846869"],"abstract_inverted_index":{"We":[0,25,41,64],"define":[1],"a":[2,9],"program":[3],"size":[4],"complexity":[5,76,87],"function":[6],"$H^\\infty$":[7,39,70,80],"as":[8],"variant":[10],"of":[11,28,46,69,88],"the":[12,38,44,56,61,85],"prefix-free":[13,86],"Kolmogorov":[14],"complexity,":[15],"based":[16],"on":[17],"Turing":[18],"monotone":[19,89],"machines":[20,90],"performing":[21],"possibly":[22],"unending":[23],"computations.":[24],"consider":[26],"definitions":[27],"randomness":[29],"and":[30,50,54,71],"triviality":[31],"for":[32],"sequences":[33,49,52,58],"in":[34],"${\\{0,1\\}}^\\omega$":[35],"relative":[36],"to":[37],"complexity.":[40],"prove":[42],"that":[43,55],"classes":[45],"Martin-L\u00f6f":[47],"random":[48],"$H^\\infty$-random":[51],"coincide":[53],"$H^\\infty$-trivial":[57],"are":[59],"exactly":[60],"recursive":[62],"ones.":[63],"also":[65],"study":[66],"some":[67],"properties":[68],"compare":[72],"it":[73],"with":[74,91],"other":[75],"functions.":[77],"In":[78],"particular,":[79],"is":[81],"different":[82],"from":[83],"$H^A$,":[84],"oracle":[92],"A.":[93]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}