Jump to content

Computational heuristic intelligence

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Comp-heur-intel (talk | contribs) at 07:21, 15 October 2014 (added major refeence Newell, A. (1981) THE HEURISTIC OF GEORGE POLYA AND ITS RELATION TO ARTIFICIAL INTELLIGENCE Department of Computer Science, Carnegie-Mellon University). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Computational Heuristic Intelligence[1] is a name for describing specialized programming techniques in the field of Computational intelligence (also called Artificial Intelligence). These techniques have the express goal of avoiding complexity issues, also called NP-Hard problems. They are best summarized as exemplar-based methods (Heuristics), rather than rule-based methods(Algorithms).

Another recent approach to the avoidance of complexity issues is to employ feedback control rather than feedforward modeling as a problem-solving paradigm. This approach has been called Computational cybernetics, because (a) the term 'computational' is associated with conventional computer programming techniques which represent a strategic, compiled, or feedforward model of the problem, and (b) the term 'cybernetic' is associated with conventional system operation techniques which represent a tactical, interpreted, or feedback model of the problem. Of course, real programs and real problems both contain both feedforward and feedback components. A real example which illustrates this point is that of human cognition, which clearly involves both perceptual ('bottom-up', feedback, sensor-oriented) and conceptual ('top-down', feedforward, motor-oriented) information flows and hierarchies.

see also

References

  1. ^ Newell, A. (1981) THE HEURISTIC OF GEORGE POLYA AND ITS RELATION TO ARTIFICIAL INTELLIGENCE Department of Computer Science, Carnegie-Mellon University