{"id":"https://openalex.org/W2120230527","doi":"https://doi.org/10.2178/jsl/1208359065","title":"Generic complexity of undecidable problems","display_name":"Generic complexity of undecidable problems","publication_year":2008,"publication_date":"2008-04-16","ids":{"openalex":"https://openalex.org/W2120230527","doi":"https://doi.org/10.2178/jsl/1208359065","mag":"2120230527"},"language":"en","primary_location":{"id":"doi:10.2178/jsl/1208359065","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1208359065","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic 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/A5112447861","display_name":"Alexei Myasnikov","orcid":null},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Alexei G. Myasnikov","raw_affiliation_strings":["Department of Mathematics and Statistics, Mcgill University, 805 Sherbrooke St. Montreal. QC, Canada, E-mail:","Department of Mathematics and Statistics, Mcgill University, 805 Sherbrooke St. Montreal. QC, Canada, E-mail: amiasnikov@gmail.com"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Mcgill University, 805 Sherbrooke St. Montreal. QC, Canada, E-mail:","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"Department of Mathematics and Statistics, Mcgill University, 805 Sherbrooke St. Montreal. QC, Canada, E-mail: amiasnikov@gmail.com","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031384998","display_name":"Alexander Rybalov","orcid":"https://orcid.org/0009-0001-8259-6156"},"institutions":[{"id":"https://openalex.org/I1313323035","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25","country_code":"RU","type":"government","lineage":["https://openalex.org/I1313323035"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Alexander N. Rybalov","raw_affiliation_strings":["Omsk Branch of the Institute, Of Mathematics of Siberian Branch of, Russian Academy of Science Omsk 644099, Pevtsova, 13, Russia, E-mail:","Omsk Branch of the Institute, Of Mathematics of Siberian Branch of, Russian Academy of Science Omsk 644099, Pevtsova, 13, Russia, E-mail: alexander.rybalov@gmail.ru"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Omsk Branch of the Institute, Of Mathematics of Siberian Branch of, Russian Academy of Science Omsk 644099, Pevtsova, 13, Russia, E-mail:","institution_ids":[]},{"raw_affiliation_string":"Omsk Branch of the Institute, Of Mathematics of Siberian Branch of, Russian Academy of Science Omsk 644099, Pevtsova, 13, Russia, E-mail: alexander.rybalov@gmail.ru","institution_ids":["https://openalex.org/I1313323035"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1396,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.93873425,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"73","issue":"2","first_page":"656","last_page":"673"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9987000226974487,"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/T11567","display_name":"semigroups and automata theory","score":0.9987000226974487,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9973000288009644,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9776999950408936,"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/undecidable-problem","display_name":"Undecidable problem","score":0.9986728429794312},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5338643193244934},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5338087677955627},{"id":"https://openalex.org/keywords/word-problem","display_name":"Word problem (mathematics education)","score":0.5091959834098816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4841971695423126},{"id":"https://openalex.org/keywords/halting-problem","display_name":"Halting problem","score":0.4752768576145172},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4517655670642853},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4429880380630493},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3964804410934448},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28785833716392517},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.18660968542099},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.13413918018341064},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07111591100692749}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.9986728429794312},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5338643193244934},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5338087677955627},{"id":"https://openalex.org/C90988201","wikidata":"https://www.wikidata.org/wiki/Q255912","display_name":"Word problem (mathematics education)","level":2,"score":0.5091959834098816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4841971695423126},{"id":"https://openalex.org/C137343475","wikidata":"https://www.wikidata.org/wiki/Q622849","display_name":"Halting problem","level":4,"score":0.4752768576145172},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4517655670642853},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4429880380630493},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3964804410934448},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28785833716392517},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.18660968542099},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.13413918018341064},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07111591100692749},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2178/jsl/1208359065","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1208359065","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1208359065","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1208359065","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":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/W1533538517","https://openalex.org/W1538796668","https://openalex.org/W1963569554","https://openalex.org/W1974784305","https://openalex.org/W1980224569","https://openalex.org/W1983360706","https://openalex.org/W1984820433","https://openalex.org/W2004459113","https://openalex.org/W2006226816","https://openalex.org/W2104285308","https://openalex.org/W2137752625","https://openalex.org/W2752853835","https://openalex.org/W2951072160","https://openalex.org/W4210778175"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W1501430220","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W1511851241","https://openalex.org/W2479961941","https://openalex.org/W3022248317","https://openalex.org/W1693995122","https://openalex.org/W1995628728"],"abstract_inverted_index":{"Abstract":[0],"In":[1,90],"this":[2],"paper":[3],"we":[4,45,67,107,123],"study":[5],"generic":[6,31,82,112,141],"complexity":[7,120],"of":[8,33,49,60,62,88,111,116,135],"undecidable":[9,17,27,55,64,79,126,130],"problems.":[10,65],"It":[11],"turns":[12],"out":[13],"that":[14,69],"some":[15],"classical":[16,38],"problems":[18,106],"are,":[19],"in":[20,119],"fact,":[21],"strongly":[22,30,42,54,63,85],"undecidable,":[23],"i.e.,":[24,75],"they":[25],"are":[26,71,78,93],"on":[28,80,131,140],"every":[29,81,132],"subset":[32,87],"inputs.":[34,89,136],"For":[35],"instance,":[36],"the":[37,50,117],"Halting":[39],"Problem":[40],"is":[41],"undecidable.":[43],"Moreover,":[44],"prove":[46],"an":[47],"analog":[48,115],"Rice":[51],"theorem":[52],"for":[53],"problems,":[56,74,127],"which":[57,77,128],"provides":[58],"plenty":[59],"examples":[61],"Then":[66],"show":[68],"there":[70,92],"natural":[72],"super-undecidable":[73,98,105],"problem":[76],"(not":[83],"only":[84],"generic)":[86],"particular,":[91],"finitely":[94],"presented":[95],"semigroups":[96],"with":[97],"word":[99],"problem.":[100],"To":[101],"construct":[102,124],"strongly-":[103],"and":[104],"introduce":[108],"a":[109],"method":[110],"amplification":[113,118],"(an":[114],"theory).":[121],"Finally,":[122],"absolutely":[125],"stay":[129],"non-negligible":[133],"set":[134],"Their":[137],"construction":[138],"rests":[139],"immune":[142],"sets.":[143]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}