Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/British_Museum_algorithm> ?p ?o }
Showing triples 1 to 38 of
38
with 100 triples per page.
- British_Museum_algorithm abstract "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).Similar arguments can be made to show that optimizations, theorem proving, language recognition, etc. are 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."↑".
- British_Museum_algorithm wikiPageID "920295".
- British_Museum_algorithm wikiPageLength "2173".
- British_Museum_algorithm wikiPageOutDegree "8".
- British_Museum_algorithm wikiPageRevisionID "678344587".
- British_Museum_algorithm wikiPageWikiLink Branch_and_bound.
- British_Museum_algorithm wikiPageWikiLink Breadth-first_search.
- British_Museum_algorithm wikiPageWikiLink British_Museum.
- British_Museum_algorithm wikiPageWikiLink Brute-force_search.
- British_Museum_algorithm wikiPageWikiLink Category:Algorithms.
- British_Museum_algorithm wikiPageWikiLink Category:British_Museum.
- British_Museum_algorithm wikiPageWikiLink Halting_problem.
- British_Museum_algorithm wikiPageWikiLink Infinite_monkey_theorem.
- British_Museum_algorithm wikiPageWikiLinkText "British Museum algorithm".
- British_Museum_algorithm hasPhotoCollection British_Museum_algorithm.
- British_Museum_algorithm wikiPageUsesTemplate Template:Citation_needed.
- British_Museum_algorithm wikiPageUsesTemplate Template:DADS.
- British_Museum_algorithm wikiPageUsesTemplate Template:Graph_search_algorithm.
- British_Museum_algorithm wikiPageUsesTemplate Template:Reflist.
- British_Museum_algorithm wikiPageUsesTemplate Template:Use_British_English.
- British_Museum_algorithm wikiPageUsesTemplate Template:Use_dmy_dates.
- British_Museum_algorithm subject Category:Algorithms.
- British_Museum_algorithm subject Category:British_Museum.
- British_Museum_algorithm hypernym Approach.
- British_Museum_algorithm type ProgrammingLanguage.
- British_Museum_algorithm type Algorithm.
- British_Museum_algorithm type Concept.
- British_Museum_algorithm comment "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.".
- British_Museum_algorithm label "British Museum algorithm".
- British_Museum_algorithm sameAs Algorithme_du_British_Museum.
- British_Museum_algorithm sameAs British_Museum-algoritme.
- British_Museum_algorithm sameAs m.03p_n9.
- British_Museum_algorithm sameAs Алгоритм_Британского_музея.
- British_Museum_algorithm sameAs Q1068302.
- British_Museum_algorithm sameAs Q1068302.
- British_Museum_algorithm sameAs 大英博物館算法.
- British_Museum_algorithm wasDerivedFrom British_Museum_algorithm?oldid=678344587.
- British_Museum_algorithm isPrimaryTopicOf British_Museum_algorithm.