{"id":"https://openalex.org/W2144310744","doi":"https://doi.org/10.1109/cec.2003.1299417","title":"On the connection between the no free lunch theorem and the trivial property for recursively enumerable languages","display_name":"On the connection between the no free lunch theorem and the trivial property for recursively enumerable languages","publication_year":2004,"publication_date":"2004-07-09","ids":{"openalex":"https://openalex.org/W2144310744","doi":"https://doi.org/10.1109/cec.2003.1299417","mag":"2144310744"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2003.1299417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","raw_type":"proceedings-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/A5000449082","display_name":"Eugene Eberbach","orcid":"https://orcid.org/0000-0002-9840-4016"},"institutions":[{"id":"https://openalex.org/I100633361","display_name":"University of Massachusetts Dartmouth","ror":"https://ror.org/00fzmm222","country_code":"US","type":"education","lineage":["https://openalex.org/I100633361"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"E. Eberbach","raw_affiliation_strings":["Computer and Information Science Dept., University of Massachusetts, North Dartmouth, MA","Dept. of Comput. & Inf. Sci., Massachusetts Univ., North Dartmouth, MA, USA"],"affiliations":[{"raw_affiliation_string":"Computer and Information Science Dept., University of Massachusetts, North Dartmouth, MA","institution_ids":["https://openalex.org/I100633361"]},{"raw_affiliation_string":"Dept. of Comput. & Inf. Sci., Massachusetts Univ., North Dartmouth, MA, USA","institution_ids":["https://openalex.org/I100633361"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000449082"],"corresponding_institution_ids":["https://openalex.org/I100633361"],"apc_list":null,"apc_paid":null,"fwci":1.7988,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.87854066,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":null,"first_page":"2611","last_page":"2618"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9990000128746033,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.797636866569519},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.763385534286499},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.6188281178474426},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5257405042648315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4937065541744232},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.47669050097465515},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4630119800567627},{"id":"https://openalex.org/keywords/probabilistic-turing-machine","display_name":"Probabilistic Turing machine","score":0.457502156496048},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.45749932527542114},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.40720242261886597},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3972702920436859},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24442607164382935},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.18442988395690918},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.12720364332199097}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.797636866569519},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.763385534286499},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.6188281178474426},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5257405042648315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4937065541744232},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.47669050097465515},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4630119800567627},{"id":"https://openalex.org/C144271403","wikidata":"https://www.wikidata.org/wiki/Q1191836","display_name":"Probabilistic Turing machine","level":5,"score":0.457502156496048},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.45749932527542114},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.40720242261886597},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3972702920436859},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24442607164382935},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.18442988395690918},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.12720364332199097},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"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/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2003.1299417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W51799866","https://openalex.org/W1505364149","https://openalex.org/W1573534773","https://openalex.org/W1830866146","https://openalex.org/W1880148665","https://openalex.org/W1970543329","https://openalex.org/W1970654545","https://openalex.org/W1976503857","https://openalex.org/W1978970913","https://openalex.org/W1994778908","https://openalex.org/W2013672985","https://openalex.org/W2047764386","https://openalex.org/W2079779258","https://openalex.org/W2095832552","https://openalex.org/W2108704847","https://openalex.org/W2113997779","https://openalex.org/W2116976042","https://openalex.org/W2126160338","https://openalex.org/W2128932399","https://openalex.org/W2151554678","https://openalex.org/W2162232298","https://openalex.org/W2264803162","https://openalex.org/W2273375038","https://openalex.org/W2284330674","https://openalex.org/W2500808186","https://openalex.org/W4210249822","https://openalex.org/W4291166496","https://openalex.org/W4301173492","https://openalex.org/W6642851245","https://openalex.org/W6662403658","https://openalex.org/W6674803478","https://openalex.org/W6678934100","https://openalex.org/W6729299910"],"related_works":["https://openalex.org/W2901084331","https://openalex.org/W1526277826","https://openalex.org/W2109115134","https://openalex.org/W2912766821","https://openalex.org/W1978292968","https://openalex.org/W3099922764","https://openalex.org/W2066136688","https://openalex.org/W1510002872","https://openalex.org/W2491249704","https://openalex.org/W2024250534"],"abstract_inverted_index":{"We":[0,21,40,68],"return":[1],"to":[2,101,110],"the":[3,12,17,24,56,60,78,83,103,116],"no":[4,25],"free":[5,26],"lunch":[6,27],"theorem,":[7],"which":[8],"is":[9,88],"one":[10],"of":[11,36,58,74,80],"most":[13],"important":[14],"theorems":[15],"from":[16],"evolutionary":[18,62,85,94,105],"computation":[19,86,95],"foundations.":[20],"show":[22],"that":[23,42,71],"theorem":[28],"can":[29],"be":[30],"interpreted":[31],"as":[32],"a":[33,53],"trivial":[34],"property":[35],"recursively":[37],"enumerable":[38],"languages.":[39],"demonstrate":[41],"if":[43],"we":[44],"consider":[45],"not":[46,89],"all":[47],"problems":[48],"and":[49,109],"cost":[50],"functions,":[51],"i.e.,":[52],"nontrivial":[54],"property,":[55],"problem":[57],"finding":[59],"best":[61,84,104],"algorithm":[63],"becomes":[64],"Turing":[65],"machine":[66],"undecidable.":[67],"also":[69],"demonstrate,":[70],"in":[72,107,115],"spite":[73],"this":[75],"negative":[76],"result,":[77],"task":[79],"search":[81],"for":[82],"operator":[87,106],"so":[90],"futile.":[91],"In":[92],"fact,":[93],"itself,":[96],"being":[97],"nonalgorithmic,":[98],"may":[99],"allow":[100],"find":[102],"infinity,":[108],"increase":[111],"indefinitely":[112],"its":[113],"quality":[114],"finite":[117],"time.":[118]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}