{"id":"https://openalex.org/W2099610644","doi":"https://doi.org/10.2307/2586583","title":"Codable sets and orbits of computably enumerable sets","display_name":"Codable sets and orbits of computably enumerable sets","publication_year":1998,"publication_date":"1998-03-01","ids":{"openalex":"https://openalex.org/W2099610644","doi":"https://doi.org/10.2307/2586583","mag":"2099610644"},"language":"en","primary_location":{"id":"doi:10.2307/2586583","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2586583","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/A5103437344","display_name":"Leo Harrington","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Leo Harrington","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5023422267","display_name":"Robert I. Soare","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert I. Soare","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103437344"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0338,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.87179264,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"63","issue":"1","first_page":"1","last_page":"28"},"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/T11567","display_name":"semigroups and automata theory","score":0.9833999872207642,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9695000052452087,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/mathematics","display_name":"Mathematics","score":0.7344410419464111},{"id":"https://openalex.org/keywords/slowness","display_name":"Slowness","score":0.6792420744895935},{"id":"https://openalex.org/keywords/maximal-set","display_name":"Maximal set","score":0.5854034423828125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5195408463478088},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.5168017148971558},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.511177122592926},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5013091564178467},{"id":"https://openalex.org/keywords/automorphism-group","display_name":"Automorphism group","score":0.4706054627895355},{"id":"https://openalex.org/keywords/computable-number","display_name":"Computable number","score":0.46113502979278564},{"id":"https://openalex.org/keywords/orbit","display_name":"Orbit (dynamics)","score":0.4330224096775055},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4278993010520935},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42394939064979553},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.4065462648868561},{"id":"https://openalex.org/keywords/automorphism","display_name":"Automorphism","score":0.30379796028137207},{"id":"https://openalex.org/keywords/computable-analysis","display_name":"Computable analysis","score":0.1658421754837036},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16161376237869263},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.04940718412399292}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7344410419464111},{"id":"https://openalex.org/C11940443","wikidata":"https://www.wikidata.org/wiki/Q16965645","display_name":"Slowness","level":2,"score":0.6792420744895935},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.5854034423828125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5195408463478088},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.5168017148971558},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.511177122592926},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5013091564178467},{"id":"https://openalex.org/C2988750069","wikidata":"https://www.wikidata.org/wiki/Q60790315","display_name":"Automorphism group","level":3,"score":0.4706054627895355},{"id":"https://openalex.org/C156382255","wikidata":"https://www.wikidata.org/wiki/Q818895","display_name":"Computable number","level":4,"score":0.46113502979278564},{"id":"https://openalex.org/C196644772","wikidata":"https://www.wikidata.org/wiki/Q3884964","display_name":"Orbit (dynamics)","level":2,"score":0.4330224096775055},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4278993010520935},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42394939064979553},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.4065462648868561},{"id":"https://openalex.org/C118712358","wikidata":"https://www.wikidata.org/wiki/Q782566","display_name":"Automorphism","level":2,"score":0.30379796028137207},{"id":"https://openalex.org/C27318111","wikidata":"https://www.wikidata.org/wiki/Q5157264","display_name":"Computable analysis","level":3,"score":0.1658421754837036},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16161376237869263},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.04940718412399292},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2307/2586583","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2586583","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/1183745453","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183745453","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.39.5353","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.5353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uchicago.edu/~soare/papers/orbit.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.6600000262260437,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1510551874","https://openalex.org/W1965251765","https://openalex.org/W1970654545","https://openalex.org/W1972481159","https://openalex.org/W1976647442","https://openalex.org/W1986918418","https://openalex.org/W1996663206","https://openalex.org/W2005402036","https://openalex.org/W2023282267","https://openalex.org/W2024348511","https://openalex.org/W2029823283","https://openalex.org/W2037469541","https://openalex.org/W2039559454","https://openalex.org/W2045033949","https://openalex.org/W2048588931","https://openalex.org/W2073407285","https://openalex.org/W2101746971","https://openalex.org/W2132161762","https://openalex.org/W2150311525","https://openalex.org/W2315181607","https://openalex.org/W4232277851","https://openalex.org/W4291166496"],"related_works":["https://openalex.org/W2037833610","https://openalex.org/W2089792255","https://openalex.org/W2135152748","https://openalex.org/W2069987267","https://openalex.org/W1973052363","https://openalex.org/W1972481159","https://openalex.org/W2112189052","https://openalex.org/W2000487993","https://openalex.org/W1980641386","https://openalex.org/W2914940747"],"abstract_inverted_index":{"Abstract":[0],"A":[1,141,151],"set":[2],"X":[3,65,87,98,112,123,154],"of":[4,35,106,108,133,150],"nonnegative":[5],"integers":[6],"is":[7,22,66,128],"computably":[8,37],"enumerable":[9,16,38],"(":[10,17],"c.e":[11],".),":[12,19],"also":[13],"called":[14],"recursively":[15],"r.e":[18],"if":[20],"there":[21,144],"a":[23,54,89,101],"computable":[24,129],"method":[25,171],"to":[26],"list":[27],"its":[28],"elements.":[29],"Let":[30],"\u03b5":[31,42,143],"denote":[32],"the":[33,36,94,148,169],"structure":[34],"sets":[39],"under":[40,158],"inclusion,":[41],"=":[43],"({":[44],"W":[45],"e":[46,48],"}":[47],"\u03f5\u03c9":[49],",\u2286).":[50],"We":[51,165],"previously":[52],"exhibited":[53],"first":[55,82],"order":[56],"\u03b5-definable":[57],"property":[58,92,127],"Q(X)":[59,62,84],"such":[60,152],"that":[61,64,83,86,121,153],"guarantees":[63],"not":[67,72],"Turing":[68,160],"complete":[69,74],"(i.e.,":[70],"does":[71],"code":[73],"information":[75,116],"about":[76],"c.e.":[77],"sets).":[78],"Here":[79],"we":[80,119,172],"show":[81],"implies":[85],"has":[88],"certain":[90,102],"\u201cslowness\u201d":[91],"whereby":[93],"elements":[95],"must":[96],"enter":[97],"slowly":[99],"(under":[100],"precise":[103],"complexity":[104],"measure":[105],"speed":[107],"computation)":[109],"even":[110],"though":[111],"may":[113],"have":[114],"high":[115],"content.":[117],"Second":[118],"prove":[120],"every":[122],"with":[124],"this":[125],"slowness":[126],"in":[130,147],"some":[131],"member":[132],"any":[134,139],"nontrivial":[135],"orbit,":[136],"namely":[137],"for":[138],"noncomputable":[140],"\u03f5":[142],"exists":[145],"B":[146,157,167],"orbit":[149],"\u2264":[155],"T":[156,163],"relative":[159],"computability":[161],"(\u2264":[162],").":[164],"produce":[166],"using":[168],"-automorphism":[170],"introduced":[173],"earlier.":[174]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}