{"id":"https://openalex.org/W2063202211","doi":"https://doi.org/10.2307/2273412","title":"Recursively enumerable complexity sequences and measure independence","display_name":"Recursively enumerable complexity sequences and measure independence","publication_year":1980,"publication_date":"1980-09-01","ids":{"openalex":"https://openalex.org/W2063202211","doi":"https://doi.org/10.2307/2273412","mag":"2063202211"},"language":"en","primary_location":{"id":"doi:10.2307/2273412","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273412","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/A5050945393","display_name":"Victor L. Bennison","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Victor L. Bennison","raw_affiliation_strings":["Bell Laboratories, Naperville, Illinois 60540"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Naperville, Illinois 60540","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050945393"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5745,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67705683,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"45","issue":"3","first_page":"417","last_page":"438"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994999766349792,"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.9994999766349792,"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.9789000153541565,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9648000001907349,"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/recursion","display_name":"Recursion (computer science)","score":0.7830134630203247},{"id":"https://openalex.org/keywords/computability-theory","display_name":"Computability theory","score":0.7391867637634277},{"id":"https://openalex.org/keywords/parallels","display_name":"Parallels","score":0.6534781455993652},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.6203567981719971},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.5545731782913208},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.550555944442749},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5399238467216492},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5380581617355347},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5355209112167358},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4834343194961548},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.481018602848053},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.4596765339374542},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.43466565012931824},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3927748203277588},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3627278208732605},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3458773195743561},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2745952606201172},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2666921019554138},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.21094295382499695}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7830134630203247},{"id":"https://openalex.org/C111142201","wikidata":"https://www.wikidata.org/wiki/Q818930","display_name":"Computability theory","level":2,"score":0.7391867637634277},{"id":"https://openalex.org/C2775922551","wikidata":"https://www.wikidata.org/wiki/Q7135033","display_name":"Parallels","level":2,"score":0.6534781455993652},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6203567981719971},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.5545731782913208},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.550555944442749},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5399238467216492},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5380581617355347},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5355209112167358},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4834343194961548},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.481018602848053},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.4596765339374542},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.43466565012931824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3927748203277588},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3627278208732605},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3458773195743561},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2745952606201172},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2666921019554138},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.21094295382499695},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2307/2273412","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273412","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/1183740610","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183740610","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":12,"referenced_works":["https://openalex.org/W632099468","https://openalex.org/W1752550407","https://openalex.org/W1975592766","https://openalex.org/W2012030760","https://openalex.org/W2020242021","https://openalex.org/W2021141490","https://openalex.org/W2029823283","https://openalex.org/W2035558335","https://openalex.org/W2069890413","https://openalex.org/W2089442854","https://openalex.org/W2530006810","https://openalex.org/W2905135108"],"related_works":["https://openalex.org/W2964237202","https://openalex.org/W1988772559","https://openalex.org/W3094951835","https://openalex.org/W2029183607","https://openalex.org/W2555446247","https://openalex.org/W2079745007","https://openalex.org/W2295040078","https://openalex.org/W2063202211","https://openalex.org/W2089982125","https://openalex.org/W2188019447"],"abstract_inverted_index":{"Though":[0],"researchers":[1],"in":[2,20,40,128],"the":[3,14,21,26,46,49,79,135,155,158,217,225,234,240,334],"field":[4],"of":[5,13,16,23,38,58,71,85,137,157,180,228,233,242,266,336,354],"abstract":[6,162,218,236],"computational":[7,163],"complexity":[8,104,148,164,237,292,340,357],"theory":[9,19,42,165],"have":[10,63,98,288,305],"utilized":[11],"many":[12],"tools":[15],"recursive":[17],"function":[18,208,277],"development":[22],"their":[24,129,177],"field,":[25],"early":[27],"results":[28,39,50,84,112,136],"obtained":[29],"(e.g.,":[30],"see":[31],"[8])":[32],"seemed":[33],"to":[34,45,55,62,176,185,201,211,214,269,282,304,364],"be":[35,212,255,262,312,328,365],"rather":[36,117],"independent":[37],"recursion":[41,108,143,307,316],"(at":[43],"least":[44],"extent":[47],"that":[48,68,275],"were":[51],"not":[52,114,287,327,333],"uniformly":[53],"interesting":[54,120],"both":[56],"varieties":[57],"theorists).":[59],"It":[60,325],"seems":[61],"been":[64],"generally":[65],"accepted,":[66],"however,":[67,220],"strong":[69],"parallels":[70],"one":[72,264,359],"form":[73],"or":[74,173,209,230,278,332],"another":[75],"must":[76,311],"exist":[77],"between":[78,103],"two":[80],"fields.":[81,131],"Indeed,":[82],"recent":[83],"Blum":[86,243],"and":[87,94,107,126,298],"Marques":[88],"[7],":[89],"Morris":[90],"[13],":[91],"Soare":[92],"[15]":[93],"Bennison":[95],"[1],":[96],"[3]":[97],"revealed":[99],"a":[100,142,147,207,276,289,302,306,315],"striking":[101],"correspondence":[102],"theoretic":[105,109,144,149,197,308,317],"properties":[106,121],"properties.":[110],"These":[111],"are":[113,167],"contrived,":[115],"but":[116],"link":[118],"together":[119],"which":[122,151,194,360],"had":[123,152],"arisen":[124,153],"naturally":[125],"independently":[127],"respective":[130],"This":[132],"paper":[133,259],"presents":[134],"research":[138],"aimed":[139],"at":[140],"finding":[141],"characterization":[145,309],"for":[146,206,314],"property":[150,303,318,335],"from":[154],"study":[156],"speed-up":[159],"phenomenon.":[160],"In":[161,216,249,257],"we":[166,199,260,272],"concerned":[168],"with":[169],"categorizing":[170],"computable":[171],"functions":[172,229],"sets":[174,231],"according":[175],"relative":[178],"difficulty":[179],"computation.":[181],"The":[182],"phrase":[183],"\u201cdifficult":[184,268],"compute\u201d":[186],"may":[187],"take":[188],"on":[189,193],"different":[190],"meanings":[191],"depending":[192],"criteria":[195,222,253],"(complexity":[196],"properties)":[198],"use":[200],"define":[202],"what":[203],"it":[204,285,310],"means":[205],"set":[210,279],"hard":[213],"compute.":[215],"setting,":[219],"such":[221,252],"should":[223,254],"yield":[224],"same":[226],"classes":[227],"regardless":[232],"underlying":[235],"measure":[238],"(in":[239],"sense":[241],"[4],":[244],"e.g.,":[245],"tape,":[246],"time,":[247],"etc.).":[248],"other":[250],"words,":[251],"measure-independent.":[256,324,343,366],"this":[258,346],"will":[261,326],"considering":[263,350],"way":[265],"defining":[267],"compute\u201d.":[270],"Namely,":[271],"shall":[273],"say":[274],"is":[280,342,361],"difficult":[281],"compute":[283],"if":[284],"does":[286],"recursively":[290],"enumerable":[291],"sequence":[293,341],"as":[294],"defined":[295],"by":[296,320,348],"Meyer":[297],"Fischer":[299],"[12].":[300],"For":[301],"measure-independent,":[313],"is,":[319],"its":[321],"very":[322],"nature,":[323],"immediately":[329],"obvious":[330],"whether":[331],"having":[337],"an":[338,351,355],"r.e.":[339,356],"We":[344],"attack":[345],"question":[347],"first":[349],"alternative":[352],"definition":[353],"sequence,":[358],"easily":[362],"seen":[363]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}