General Problem Solver
Computer program created in 1959
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.
Nº Q1387212 ★
Common · Literature
General Problem Solver
Computer program created in 1959
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.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
L
Logic Theorist
Computer program
Nº Q4391896 ★★
Not listed
-
GPSS
General-purpose programming language
Nº Q1486554 ★
Not listed
-
A
Allen Newell
American cognitive scientist (1927–1992)
Nº Q439245 ★
Not listed
-
S
Simon's problem
Problem involving an oracle, which quantum computers can solve exponentially faster than classical computers; an oracle separation of BQP and BPP
Nº Q5763587 ★
Not listed
-
J
Jacobi method
Iterative method used to solve a linear system of equations
Nº Q1481893 ★★
Not listed
-
E
Entscheidungsproblem
In computer science, the impossible task of algorithmically determining whether a given statement is provable from the axioms
Nº Q11030584 ★★
Not listed