Definition from Wiktionary, the free dictionary
- (of an approach to problem solving, learning, or discovery) That employs a practical method not guaranteed to be optimal or perfect; not following or derived from any theory.
2015, Ippoliti, Emiliano; Thomas Nickles, Heuristic Reasoning:
- "The heuristic appraisal is the 'identification and evaluation of hints and clues that can provide direction to inquiry in the sometimes large gap between the extremes of complete knowledge and complete ignorance'”.
- (computing, of a method or algorithm) That solves a problem more quickly but is not certain to arrive at an optimal solution.
2002, Te Chiang Hu, Man-tak Shing, Combinatorial Algorithms:
- If a heuristic algorithm works for most of the input data or its maximum percentage error is tolerable, we may prefer the heuristic algorithm to an optimum algorithm that requires a long time.
- (of an argument) That reasons from the value of a method or principle that has been shown by experimental investigation to be a useful aid in learning, discovery and problem-solving.
relating to general strategies or methods for solving problems
in computing, that is not certain to arrive at an optimal solution
heuristic (plural heuristics)
- A heuristic method.
- The art of applying heuristic methods.
- (computing) A technique designed for solving a problem when classic methods are too slow or fail to find any exact solution.
heuristic method, heuristics