In computer science and mathematics, a full employment theorem is 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. Tasks such as virus writing and detection, and spam filtering and filter-breaking are also subject to Rice's theorem.