British Museum algorithm

British Museum Algorithm

British Museum algorithm

to get instant updates about 'British Museum Algorithm' on your MyPage. Meet other similar minded people. Its Free!


All Updates

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 are 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).

Similar arguments can be made to show that optimizations, theorem proving, language recognition, etc. is possible or impossible.

Newell, Shaw, and Simon 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


  • Original text by .


Read More

No feeds found

Posting your question. Please wait!...

No updates available.
No messages found
Suggested Pages
Tell your friends >
about this page
 Create a new Page
for companies, colleges, celebrities or anything you like.Get updates on MyPage.
Create a new Page
 Find your friends
  Find friends on MyPage from