{"id":"https://openalex.org/W2047756104","doi":"https://doi.org/10.1215/00294527-1716757","title":"Uncomputably Noisy Ergodic Limits","display_name":"Uncomputably Noisy Ergodic Limits","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2047756104","doi":"https://doi.org/10.1215/00294527-1716757","mag":"2047756104"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-1716757","is_oa":false,"landing_page_url":"https://doi.org/10.1215/00294527-1716757","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1105.0663","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jeremy Avigad","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jeremy Avigad","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6959,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71759597,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"53","issue":"3","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":0.9782000184059143,"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.9782000184059143,"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/T12162","display_name":"Cellular Automata and Applications","score":0.006399999838322401,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.002300000051036477,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ergodic-theory","display_name":"Ergodic theory","score":0.9035000205039978},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6629999876022339},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6416000127792358},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.633400022983551},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.6226999759674072},{"id":"https://openalex.org/keywords/computable-analysis","display_name":"Computable analysis","score":0.5698999762535095},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5400999784469604},{"id":"https://openalex.org/keywords/almost-everywhere","display_name":"Almost everywhere","score":0.5181999802589417}],"concepts":[{"id":"https://openalex.org/C122044880","wikidata":"https://www.wikidata.org/wiki/Q5498822","display_name":"Ergodic theory","level":2,"score":0.9035000205039978},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7786999940872192},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6629999876022339},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6416000127792358},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.633400022983551},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.6226999759674072},{"id":"https://openalex.org/C27318111","wikidata":"https://www.wikidata.org/wiki/Q5157264","display_name":"Computable analysis","level":3,"score":0.5698999762535095},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5400999784469604},{"id":"https://openalex.org/C27142425","wikidata":"https://www.wikidata.org/wiki/Q1139334","display_name":"Almost everywhere","level":2,"score":0.5181999802589417},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5181999802589417},{"id":"https://openalex.org/C156382255","wikidata":"https://www.wikidata.org/wiki/Q818895","display_name":"Computable number","level":4,"score":0.5026999711990356},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.43810001015663147},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.421999990940094},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37059998512268066},{"id":"https://openalex.org/C201779956","wikidata":"https://www.wikidata.org/wiki/Q5426803","display_name":"Ergodicity","level":2,"score":0.34369999170303345},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3116999864578247},{"id":"https://openalex.org/C98458673","wikidata":"https://www.wikidata.org/wiki/Q917657","display_name":"Step function","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C151424130","wikidata":"https://www.wikidata.org/wiki/Q17123911","display_name":"Stationary ergodic process","level":4,"score":0.2928999960422516},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.2924000024795532},{"id":"https://openalex.org/C115667082","wikidata":"https://www.wikidata.org/wiki/Q4200518","display_name":"Invariant measure","level":3,"score":0.26179999113082886},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.26100000739097595},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1215/00294527-1716757","is_oa":false,"landing_page_url":"https://doi.org/10.1215/00294527-1716757","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:arXiv.org:1105.0663","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1105.0663","pdf_url":"https://arxiv.org/pdf/1105.0663","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":null,"raw_type":"text"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1348577704","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1348577704","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1105.0663","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1105.0663","pdf_url":"https://arxiv.org/pdf/1105.0663","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2063998075","https://openalex.org/W2071065290","https://openalex.org/W2101900964","https://openalex.org/W2320887888"],"related_works":[],"abstract_inverted_index":{"V\u2019yugin":[0],"has":[1],"shown":[2,37],"that":[3,18,38,49,61],"there":[4,19,50,63],"are":[5],"a":[6,13,71,83],"computable":[7,22,53,66],"shift-invariant":[8],"measure":[9],"on":[10,24,55,68],"2N":[11],"and":[12],"simple":[14,72],"function":[15,73],"f":[16],"such":[17],"is":[20,36,51,64],"no":[21,52,65],"bound":[23,54,67],"the":[25,30,47,56,59,79],"rate":[26],"of":[27,29,58],"convergence":[28],"ergodic":[31],"averages":[32],"Anf.":[33],"Here":[34],"it":[35],"in":[39],"fact":[40],"one":[41],"can":[42],"construct":[43],"an":[44],"example":[45],"with":[46],"property":[48],"complexity":[57],"limit;":[60],"is,":[62],"how":[69],"complex":[70],"needs":[74],"to":[75,77,81],"be":[76],"approximate":[78],"limit":[80],"within":[82],"given":[84],"\u03b5.":[85]},"counts_by_year":[{"year":2014,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2016-06-24T00:00:00"}