{"id":"https://openalex.org/W3138044606","doi":"https://doi.org/10.1017/s1755020321000125","title":"A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE","display_name":"A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE","publication_year":2021,"publication_date":"2021-03-22","ids":{"openalex":"https://openalex.org/W3138044606","doi":"https://doi.org/10.1017/s1755020321000125","mag":"3138044606"},"language":"en","primary_location":{"id":"doi:10.1017/s1755020321000125","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1755020321000125","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BEB98143DA5F2FF4A378B5C7B07B5EC9/S1755020321000125a.pdf/div-class-title-a-note-on-the-learning-theoretic-characterizations-of-randomness-and-convergence-div.pdf","source":{"id":"https://openalex.org/S24077076","display_name":"The Review of Symbolic Logic","issn_l":"1755-0203","issn":["1755-0203","1755-0211"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Review of Symbolic Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BEB98143DA5F2FF4A378B5C7B07B5EC9/S1755020321000125a.pdf/div-class-title-a-note-on-the-learning-theoretic-characterizations-of-randomness-and-convergence-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023992985","display_name":"Tomasz Steifer","orcid":"https://orcid.org/0000-0003-0753-1042"},"institutions":[{"id":"https://openalex.org/I4210119410","display_name":"Institute of Fundamental Technological Research","ror":"https://ror.org/03fs4aq04","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210119410","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"TOMASZ STEIFER","raw_affiliation_strings":["INSTITUTE OF FUNDAMENTAL TECHNOLOGICAL RESEARCH POLISH ACADEMY OF SCIENCES UL. PAWINSKIEGO 5B, 02-106, WARSZAWA, POLANDE-mail:"],"affiliations":[{"raw_affiliation_string":"INSTITUTE OF FUNDAMENTAL TECHNOLOGICAL RESEARCH POLISH ACADEMY OF SCIENCES UL. PAWINSKIEGO 5B, 02-106, WARSZAWA, POLANDE-mail:","institution_ids":["https://openalex.org/I4210119410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023992985"],"corresponding_institution_ids":["https://openalex.org/I4210119410"],"apc_list":null,"apc_paid":null,"fwci":0.5919,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70389685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"15","issue":"3","first_page":"807","last_page":"822"},"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.9854000210762024,"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.9843999743461609,"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/randomness","display_name":"Randomness","score":0.943688154220581},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.8237040042877197},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.739122211933136},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6576663851737976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5405700206756592},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44250500202178955},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4102453589439392},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4048716127872467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3310990333557129},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.05570361018180847}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.943688154220581},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.8237040042877197},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.739122211933136},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6576663851737976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5405700206756592},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44250500202178955},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4102453589439392},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4048716127872467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3310990333557129},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.05570361018180847},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1755020321000125","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1755020321000125","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BEB98143DA5F2FF4A378B5C7B07B5EC9/S1755020321000125a.pdf/div-class-title-a-note-on-the-learning-theoretic-characterizations-of-randomness-and-convergence-div.pdf","source":{"id":"https://openalex.org/S24077076","display_name":"The Review of Symbolic Logic","issn_l":"1755-0203","issn":["1755-0203","1755-0211"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Review of Symbolic Logic","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s1755020321000125","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1755020321000125","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BEB98143DA5F2FF4A378B5C7B07B5EC9/S1755020321000125a.pdf/div-class-title-a-note-on-the-learning-theoretic-characterizations-of-randomness-and-convergence-div.pdf","source":{"id":"https://openalex.org/S24077076","display_name":"The Review of Symbolic Logic","issn_l":"1755-0203","issn":["1755-0203","1755-0211"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Review of Symbolic Logic","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3138044606.pdf","grobid_xml":"https://content.openalex.org/works/W3138044606.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1574049752","https://openalex.org/W1593512589","https://openalex.org/W1608681593","https://openalex.org/W1797327129","https://openalex.org/W1854153889","https://openalex.org/W1860836677","https://openalex.org/W1968250327","https://openalex.org/W1982389390","https://openalex.org/W2042260931","https://openalex.org/W2048211742","https://openalex.org/W2063998075","https://openalex.org/W2066626864","https://openalex.org/W2067580807","https://openalex.org/W2082158498","https://openalex.org/W2087237939","https://openalex.org/W2111109206","https://openalex.org/W2135625884","https://openalex.org/W2157192608","https://openalex.org/W2188564768","https://openalex.org/W2986239583","https://openalex.org/W3021426684","https://openalex.org/W3021969183","https://openalex.org/W3091923320","https://openalex.org/W3102543632","https://openalex.org/W3174372362","https://openalex.org/W4213350211","https://openalex.org/W4237518902"],"related_works":["https://openalex.org/W2951103138","https://openalex.org/W4302764995","https://openalex.org/W1571617560","https://openalex.org/W4299568366","https://openalex.org/W2950344047","https://openalex.org/W2483853972","https://openalex.org/W3014725678","https://openalex.org/W1590541736","https://openalex.org/W59659330","https://openalex.org/W4237858032"],"abstract_inverted_index":{"Abstract":[0],"Recently,":[1],"a":[2,47],"connection":[3,71],"has":[4],"been":[5],"established":[6],"between":[7,14,72],"two":[8],"branches":[9],"of":[10,23,26,39,51,78],"computability":[11],"theory,":[12],"namely":[13],"algorithmic":[15,18],"randomness":[16,27],"and":[17,75],"learning":[19],"theory.":[20],"Learning-theoretical":[21],"characterizations":[22,33,74],"several":[24],"notions":[25],"were":[28],"discovered.":[29],"We":[30],"study":[31],"such":[32],"based":[34],"on":[35,80],"the":[36,55,69,76],"asymptotic":[37],"density":[38],"positive":[40],"answers.":[41],"In":[42],"particular,":[43],"this":[44],"note":[45,66],"provides":[46],"new":[48],"learning-theoretic":[49],"definition":[50],"weak":[52],"2-randomness,":[53],"solving":[54],"problem":[56,77],"posed":[57],"by":[58],"(Zaffora":[59],"Blando,":[60],"Rev.":[61],"Symb.":[62],"Log.":[63],"2019).":[64],"The":[65],"also":[67],"highlights":[68],"close":[70],"these":[73],"convergence":[79],"random":[81],"sequences.":[82]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}