Computer Science
In computer science, a heuristic is a technique designed for solving a problem quicker when classic methods are too slow, or for finding an approximate solution when classic methods fail to find any exact solution. By trading optimality, completeness, accuracy, and/or precision for speed, a heuristic can quickly produce a solution that is good enough for solving the problem at hand, as opposed to finding all exact solutions in a prohibitively long time.
For example, many real-time anti-virus scanners use heuristic signatures for detecting viruses and other forms of malware.
One way of achieving this computational performance gain consists in solving a simpler problem whose solution is also a solution to the more complex problem. See the main article for more details.
Read more about this topic: Heuristic
Famous quotes containing the words computer and/or science:
“The analogy between the mind and a computer fails for many reasons. The brain is constructed by principles that assure diversity and degeneracy. Unlike a computer, it has no replicative memory. It is historical and value driven. It forms categories by internal criteria and by constraints acting at many scales, not by means of a syntactically constructed program. The world with which the brain interacts is not unequivocally made up of classical categories.”
—Gerald M. Edelman (b. 1928)
“Curiosity engenders both science and scandal.”
—Mason Cooley (b. 1927)