British Museum algorithm: Difference between revisions
Reconjugated verb |
m en-GB |
||
| Line 1: | Line 1: | ||
{{Use dmy dates|date=August 2015}} |
|||
{{Use British English|date=August 2015}} |
|||
{{graph search algorithm}} |
{{graph search algorithm}} |
||
Revision as of 19:56, 23 August 2015
Template:Graph search algorithm
The British Museum algorithm is a general approach to find a solution by checking all possibilities one by one, beginning with the smallest. The term refers to a conceptual, not a practical, technique where the number of possibilities is enormous.
For instance, one may, in theory, find the smallest program that solves a particular problem in the following way: Generate all possible source codes of length one character. Check each one to see if it solves the problem. (Note: the halting problem makes this check troublesome.) If not, generate and check all programs of two characters, three characters, etc. Conceptually, this finds the smallest program, but in practice it tends to take an unacceptable amount of time (more than the lifetime of the universe, in many instances) [citation needed].
Similar arguments can be made to show that optimizations, theorem proving, language recognition, etc. are possible or impossible.
Newell, Shaw, and Simon[1] called this procedure the British Museum algorithm
- "... since it seemed to them as sensible as placing monkeys in front of typewriters in order to reproduce all the books in the British Museum."
See also
Sources
- Original text by
This article incorporates public domain material from Paul E. Black. "British Museum technique". Dictionary of Algorithms and Data Structures. NIST..
References
- ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1037/h0048495, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with
|doi=10.1037/h0048495instead.