Geometry Program

Program works backward from geometric theorems, searching for proofs by means-end analysis. It breaks down problems using a hierarchy of goals and subgoals and uses heuristics to select the most promising search paths and avoid impossible paths.

107


H. Gelernter, 1963.

RELATED ARTICLESExplain
Artificial Intelligence
Can computers think? [1]
No: computers can't be creative
Computers have already been creative
Examples of creative computer models
Geometry Program
AARON
Book Generator
Haiku Program
TALE-SPIN
The Jazz Generator
Graph of this discussion
Enter the title of your article


Enter a short (max 500 characters) summation of your article
Enter the main body of your article
Lock
+Comments (0)
+Citations (0)
+About
Enter comment

Select article text to quote
welcome text

First name   Last name 

Email

Skip