britishmusm.html
字号:
<!DOCTYPE HTML PUBLIC "-//IETF//DTD W3 HTML 2.0//EN">
<HTML lang="en-US">
<HEAD>
<TITLE>British Museum algorithm</TITLE>
<META name="description"
content="Definition of British Museum algorithm,
possibly with links to more information and implementations.">
<META name="keywords" content="British Museum algorithm">
</HEAD>
<BODY BGCOLOR="#FFFFFF">
<H1>British Museum algorithm</H1>
<P>
(algorithmic technique)
<P>
<strong>Definition:</strong>
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.
<P><strong>See also</strong>
<a href="breadthfirst.html" tppabs="http://hissa.nist.gov/dads/HTML/breadthfirst.html"><em>breadth first search</em></a>, <a href="bruteforce.html" tppabs="http://hissa.nist.gov/dads/HTML/bruteforce.html"><em>brute force</em></a>, <a href="exhaustvsrch.html" tppabs="http://hissa.nist.gov/dads/HTML/exhaustvsrch.html"><em>exhaustive search</em></a>.
<P><em>Note:
For instance, one may, in theory, find the smallest program which solves a particular problem as follows. Generate all possible source codes of length one character. Check each one to see if it solves the problems. If not, generate and check all programs of two characters, three characters, etc. Conceptually this finds the smallest program, but in practise it takes far more time than the age of the universe. <P> Similar arguments can be made to show that optimizations, theorem proving, language recognition, etc. is possible or impossible.</em>
<P>Author: <a href="terms.html#authorPEB" tppabs="http://hissa.nist.gov/dads/terms.html#authorPEB">PEB</a>
<hr>
Go to the
<A HREF="terms.html" tppabs="http://hissa.nist.gov/dads/terms.html">Algorithms, Data Structures, and Problems</A>
home page.
<hr>
If you have suggestions, corrections, or comments, please get in touch
with
<a href="javascript:if(confirm('http://hissa.nist.gov/~black/black.html \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address. \n\nDo you want to open it from the server?'))window.location='http://hissa.nist.gov/~black/black.html'" tppabs="http://hissa.nist.gov/~black/black.html">Paul E. Black</a>
(<a href="mailto:paul.black@nist.gov">paul.black@nist.gov</a>).
<p>
Entry modified Tue Nov 2 13:20:46 1999.<BR>
HTML page formatted Wed Dec 22 09:34:52 1999.
<P>
This page's URL is
<A href="britishmusm.html" tppabs="http://hissa.nist.gov/dads/HTML/britishmusm.html">http://hissa.nist.gov/dads/HTML/britishmusm.html</A>
</BODY>
</HTML>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -