Full-employment theorem (original) (raw)

About DBpedia

In computer science and mathematics, a full employment theorem is a term used, often humorously, to refer to a theorem which states that no algorithm can optimally perform a particular task done by some class of professionals. The name arises because such a theorem ensures that there is endless scope to keep discovering new techniques to improve the way at least some specific task is done.

Property Value
dbo:abstract In computer science and mathematics, a full employment theorem is a term used, often humorously, to refer to a theorem which states that no algorithm can optimally perform a particular task done by some class of professionals. The name arises because such a theorem ensures that there is endless scope to keep discovering new techniques to improve the way at least some specific task is done. For example, the full employment theorem for compiler writers states that there is no such thing as a provably perfect size-optimizing compiler, as such a proof for the compiler would have to detect non-terminating computations and reduce them to a one-instruction infinite loop. Thus, the existence of a provably perfect size-optimizing compiler would imply a solution to the halting problem, which cannot exist. This also implies that there may always be a better compiler since the proof that one has the best compiler cannot exist. Therefore, compiler writers will always be able to speculate that they have something to improve. A similar example in practical computer science is the idea of no free lunch in search and optimization, which states that no efficient general-purpose solver can exist, and hence there will always be some particular problem whose best known solution might be improved. Similarly, Gödel's incompleteness theorems have been called full employment theorems for mathematicians. Tasks such as virus writing and detection, and spam filtering and filter-breaking are also subject to Rice's theorem. (en)
dbo:wikiPageExternalLink http://world.std.com/~rjs/z138.pdf https://web.archive.org/web/20050402183906/http:/www.cis.upenn.edu/~cis570/slides/lecture01.pdf
dbo:wikiPageID 5723289 (xsd:integer)
dbo:wikiPageLength 2506 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID 1090287865 (xsd:integer)
dbo:wikiPageWikiLink dbr:No_free_lunch_in_search_and_optimization dbr:Infinite_loop dbr:Mathematics dbr:Computer_science dbr:Computer_virus dbc:Mathematical_theorems dbr:Gödel's_incompleteness_theorems dbr:Halting_problem dbc:Theoretical_computer_science dbr:Spam_(electronic) dbr:Rice's_theorem
dbp:wikiPageUsesTemplate dbt:ISBN dbt:Short_description
dcterms:subject dbc:Mathematical_theorems dbc:Theoretical_computer_science
rdfs:comment In computer science and mathematics, a full employment theorem is a term used, often humorously, to refer to a theorem which states that no algorithm can optimally perform a particular task done by some class of professionals. The name arises because such a theorem ensures that there is endless scope to keep discovering new techniques to improve the way at least some specific task is done. (en)
rdfs:label Full-employment theorem (en)
owl:sameAs wikidata:Full-employment theorem https://global.dbpedia.org/id/4k1rP
prov:wasDerivedFrom wikipedia-en:Full-employment_theorem?oldid=1090287865&ns=0
foaf:isPrimaryTopicOf wikipedia-en:Full-employment_theorem
is dbo:wikiPageRedirects of dbr:Full_employment_theorem
is dbo:wikiPageWikiLink of dbr:Full_employment_theorem dbr:Optimizing_compiler
is foaf:primaryTopic of wikipedia-en:Full-employment_theorem