{"id":"https://openalex.org/W2020728339","doi":"https://doi.org/10.1007/s002240000086","title":"A Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction","display_name":"A Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction","publication_year":1998,"publication_date":"1998-05-01","ids":{"openalex":"https://openalex.org/W2020728339","doi":"https://doi.org/10.1007/s002240000086","mag":"2020728339"},"language":"en","primary_location":{"id":"doi:10.1007/s002240000086","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s002240000086","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","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/A5006703246","display_name":"Ludwig Staiger","orcid":"https://orcid.org/0000-0003-3810-9303"},"institutions":[{"id":"https://openalex.org/I68956291","display_name":"Martin Luther University Halle-Wittenberg","ror":"https://ror.org/05gqaka33","country_code":"DE","type":"education","lineage":["https://openalex.org/I68956291"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"L. Staiger","raw_affiliation_strings":["Martin-Luther-Universit\u00e4t Halle-Wittenberg, Institut f\u00fcr Informatik,   Kurt-Mothes-Strasse 1, D-06120 Halle, Germany   staiger@cantor.informatik.uni-halle.de, , , , , , DE","Martin-Luther-Universit\u00e4t Halle-Wittenberg, Institut f\u00fcr Informatik, Kurt-Mothes-Strasse 1, D-06120 Halle, Germany staiger@cantor.informatik.uni-halle.de, DE"],"affiliations":[{"raw_affiliation_string":"Martin-Luther-Universit\u00e4t Halle-Wittenberg, Institut f\u00fcr Informatik,   Kurt-Mothes-Strasse 1, D-06120 Halle, Germany   staiger@cantor.informatik.uni-halle.de, , , , , , DE","institution_ids":["https://openalex.org/I68956291"]},{"raw_affiliation_string":"Martin-Luther-Universit\u00e4t Halle-Wittenberg, Institut f\u00fcr Informatik, Kurt-Mothes-Strasse 1, D-06120 Halle, Germany staiger@cantor.informatik.uni-halle.de, DE","institution_ids":["https://openalex.org/I68956291"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006703246"],"corresponding_institution_ids":["https://openalex.org/I68956291"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.5591,"has_fulltext":false,"cited_by_count":82,"citation_normalized_percentile":{"value":0.92754632,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"31","issue":"3","first_page":"215","last_page":"229"},"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/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9912999868392944,"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/T11567","display_name":"semigroups and automata theory","score":0.9670000076293945,"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/hausdorff-dimension","display_name":"Hausdorff dimension","score":0.8824607133865356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7559752464294434},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.7389756441116333},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7051483392715454},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5612664818763733},{"id":"https://openalex.org/keywords/hausdorff-distance","display_name":"Hausdorff distance","score":0.5540324449539185},{"id":"https://openalex.org/keywords/hausdorff-measure","display_name":"Hausdorff measure","score":0.5442455410957336},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5219866037368774},{"id":"https://openalex.org/keywords/minkowski\u2013bouligand-dimension","display_name":"Minkowski\u2013Bouligand dimension","score":0.5122970342636108},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4849388897418976},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46763351559638977},{"id":"https://openalex.org/keywords/effective-dimension","display_name":"Effective dimension","score":0.44873884320259094},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.447511225938797},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.4445793628692627},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4441162049770355},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4316653907299042},{"id":"https://openalex.org/keywords/fractal","display_name":"Fractal","score":0.4166334569454193},{"id":"https://openalex.org/keywords/fractal-dimension","display_name":"Fractal dimension","score":0.34575992822647095},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2297484576702118},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15980440378189087}],"concepts":[{"id":"https://openalex.org/C194198291","wikidata":"https://www.wikidata.org/wiki/Q565186","display_name":"Hausdorff dimension","level":2,"score":0.8824607133865356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7559752464294434},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.7389756441116333},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7051483392715454},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5612664818763733},{"id":"https://openalex.org/C141898687","wikidata":"https://www.wikidata.org/wiki/Q1501997","display_name":"Hausdorff distance","level":2,"score":0.5540324449539185},{"id":"https://openalex.org/C73225184","wikidata":"https://www.wikidata.org/wiki/Q1591095","display_name":"Hausdorff measure","level":3,"score":0.5442455410957336},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5219866037368774},{"id":"https://openalex.org/C101597101","wikidata":"https://www.wikidata.org/wiki/Q2555655","display_name":"Minkowski\u2013Bouligand dimension","level":4,"score":0.5122970342636108},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4849388897418976},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46763351559638977},{"id":"https://openalex.org/C115311070","wikidata":"https://www.wikidata.org/wiki/Q5347255","display_name":"Effective dimension","level":3,"score":0.44873884320259094},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.447511225938797},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.4445793628692627},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4441162049770355},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4316653907299042},{"id":"https://openalex.org/C40636538","wikidata":"https://www.wikidata.org/wiki/Q81392","display_name":"Fractal","level":2,"score":0.4166334569454193},{"id":"https://openalex.org/C26546657","wikidata":"https://www.wikidata.org/wiki/Q1412452","display_name":"Fractal dimension","level":3,"score":0.34575992822647095},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2297484576702118},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15980440378189087},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s002240000086","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s002240000086","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","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":8,"referenced_works":["https://openalex.org/W1558941939","https://openalex.org/W1598664776","https://openalex.org/W1638203394","https://openalex.org/W1970972184","https://openalex.org/W1998090580","https://openalex.org/W2001496266","https://openalex.org/W2029308360","https://openalex.org/W2033617538"],"related_works":["https://openalex.org/W3094951835","https://openalex.org/W2793162916","https://openalex.org/W4298066149","https://openalex.org/W61625408","https://openalex.org/W1579803260","https://openalex.org/W150741891","https://openalex.org/W981500437","https://openalex.org/W2461808546","https://openalex.org/W92019728","https://openalex.org/W2033617538"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}