~2025-31680-88: There is no proof they said this and the source doesn't tell us anything about british museum sort

2025-11-06T09:56:03Z

There is no proof they said this and the source doesn't tell us anything about british museum sort

← Previous revision		Revision as of 09:56, 6 November 2025
Line 3:		Line 3:

	The '''British Museum algorithm''' is a general approach to finding 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.		The '''British Museum algorithm''' is a general approach to finding 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.

	Newell, Shaw, and Simon<ref name="newell">{{Cite journal \| last1 = Newell \| first1 = A. \| author-link1 = Allen Newell \| last2 = Shaw \| first2 = J. C. \| author-link2 = Cliff Shaw \| last3 = Simon \| first3 = H. A. \| author-link3 = Herbert A. Simon \| year = 1958 \| title = Elements of a Theory of Human Problem Solving \| journal = [[Psychological Review]] \| volume = 65 \| issue = 3 \| pages = 151–166 \| publisher = [[American Psychological Association]] \| url = https://digitalcollections.library.cmu.edu/node/35224 \| doi = 10.1037/h0048495 \| url-access = subscription }}</ref>
	~~called this procedure the British Museum algorithm~~
	~~:"... since it seemed to them as sensible as [[infinite monkey theorem\|placing monkeys in front of typewriters]] in order to reproduce all the books in the [[British Museum]]."~~

	== See also ==		== See also ==

imported>OAbot: Open access bot: url-access updated in citation with #oabot.

2025-05-28T16:28:36Z

Open access bot: url-access updated in citation with #oabot.

New page

{{Use dmy dates|date=August 2015}}
{{Use British English|date=August 2015}}

The '''British Museum algorithm''' is a general approach to finding 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.

Newell, Shaw, and Simon<ref name="newell">{{Cite journal | last1 = Newell | first1 = A. | author-link1 = Allen Newell | last2 = Shaw | first2 = J. C. | author-link2 = Cliff Shaw | last3 = Simon | first3 = H. A. | author-link3 = Herbert A. Simon | year = 1958 | title = Elements of a Theory of Human Problem Solving | journal = [[Psychological Review]] | volume = 65 | issue = 3 | pages = 151–166 | publisher = [[American Psychological Association]] | url = https://digitalcollections.library.cmu.edu/node/35224 | doi = 10.1037/h0048495 | url-access = subscription }}</ref>
called this procedure the British Museum algorithm
:"... since it seemed to them as sensible as [[infinite monkey theorem|placing monkeys in front of typewriters]] in order to reproduce all the books in the [[British Museum]]."

== See also ==
* [[Bogosort]]
* [[Branch and bound]]
* [[Breadth-first search]]
* [[Brute-force search]]

== Sources ==
{{DADS|British Museum technique|britishMuseum}}.

==References==
{{Reflist}}

[[Category:Algorithms]]
[[Category:British Museum|Algorithm]]

British Museum algorithm - Revision history

~2025-31680-88: There is no proof they said this and the source doesn't tell us anything about british museum sort

imported>OAbot: Open access bot: url-access updated in citation with #oabot.