Weak (Search) Methods
Several domain-independent heuristics can be employed by an
agent attempting
general intelligence to solve problems in many domains. These
methods can be augmented (often are) by casting problems into the generic
problem spaces.
Universal weak methods include:
Several universal strong methods exist, but these often require
copious if not complete a priori knowledge of the task domain. These
methods may be employed in expert agents or after much learning has
been done.
- Optimal Rationality
- Decision theory
The following architectures realize some (and in some cases many) of these
weak search methods:
Press
UP to go to the list of capabilities.
Press
HOME to go to the Table of Contents.