Show Summary Details

p. 1046. Heuristic computinglocked

  • Subrata Dasgupta

Abstract

Many ordinary problems and everyday activities are not conducive to algorithmic solutions. Yet, people do perform these tasks and solve such problems, so what other computational means are available to perform such tasks? The answer is to resort to a mode of computing that deploys heuristics—rules, precepts, principles, hypotheses based on common sense, experience, judgement, analogies, informed guesses, etc., which offer promise but are not guaranteed to solve problems. Heuristic computing encompasses both heuristic search and heuristic algorithms. ‘Heuristic computing’ explains a meta-heuristic called ‘satisficing’; the difference between exact and heuristic algorithms; how heuristics is used in artificial intelligence; weak and strong methods; and how to interpret heuristic rules.

Access to the complete content on Very Short Introductions online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can't find the answer there, please contact us.