Research any topic before you write.
Find related topics. | Discover entities. | See connections. | Build a topical map.
General Problem Solver (GPS) is a computer program created in 1957 by Herbert A. Simon, J. C. Shaw, and Allen Newell (RAND Corporation) intended to work as a universal problem solver machine. In contrast to the former Logic Theorist project, the GPS works with means–ends analysis.
The analysis highlights Companies and Overview as prominent areas in the source structure around General Problem Solver.
Source areas are shown by the number of related topics found in each part of the analysis. Use smaller areas too: they can reveal specialized angles and content gaps.
Smaller areas are not necessarily less important. They contain fewer connections in this analysis and can be useful for finding specialized angles or coverage gaps.
High-confidence facts extracted from structured source data. Use them as anchors for further research.
Browse the complete topic structure, not only the most central items. Less prominent entities and concepts can reveal missing angles, specialized context and useful research gaps. Each item opens a new analysis centered on that subject.
Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.
See recurring relationship patterns around General Problem Solver before inspecting the individual extracted relationships.
Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.
gps problem logic newell solver program simon general problems solve artificial intelligence computer created shaw rand corporation work theorist means
TTTA extracted 4 structured relationships around General Problem Solver. Examples in this analysis include the Towers of Hanoi that could be sufficiently formalized → instance of → IPL.While GPS solved simple problems and the Towers of Hanoi can become computationally infeasible → instance of → even a straightforward state space search. The table shows each extracted connection, where it came from and its confidence.
| Subject | Predicate | Object | Confidence | Src |
|---|---|---|---|---|
| the Towers of Hanoi that could be sufficiently formalized | instance of | IPL.While GPS solved simple problems | 0.80 | text |
| it could not solve any real-world problems because the search was easily lost in the combinatorial explosion | instance of | IPL.While GPS solved simple problems | 0.80 | text |
| the Towers of Hanoi can become computationally infeasible | instance of | even a straightforward state space search | 0.80 | text |
| albeit judicious prunings of the state space can be achieved by such elementary AI techniques as A | instance of | even a straightforward state space search | 0.80 | text |
The concept neighborhoods around General Problem Solver bring nearby vocabulary together. In this analysis, examples include Program, Herbert and Solving. Use the clusters to find adjacent concepts and terminology that may deserve separate research.
Bridges highlight paths between different parts of the General Problem Solver map and can reveal research angles that are easy to miss in a flat list.
TTTA analyzes the structure around General Problem Solver to surface related topics, entities, relationships, concept neighborhoods and bridge connections. Use the map to explore areas such as Companies & Overview, including less central topics that may reveal useful research gaps. Automatically extracted connections are research leads rather than rewritten encyclopedia content.
Source: Wikipedia — General Problem Solver · EN edition · Analysis: TopicsToTalkAbout