Matches in DBpedia 2014 for { <http://dbpedia.org/resource/British_Museum_algorithm> ?p ?o. }
Showing items 1 to 29 of
29
with 100 items 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)[citation needed].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."↑".
- British_Museum_algorithm wikiPageID "920295".
- British_Museum_algorithm wikiPageRevisionID "591143330".
- British_Museum_algorithm hasPhotoCollection British_Museum_algorithm.
- British_Museum_algorithm subject Category:Algorithms.
- British_Museum_algorithm subject Category:British_Museum.
- British_Museum_algorithm type Abstraction100002137.
- British_Museum_algorithm type Act100030358.
- British_Museum_algorithm type Activity100407535.
- British_Museum_algorithm type Algorithm105847438.
- British_Museum_algorithm type Algorithms.
- British_Museum_algorithm type Event100029378.
- British_Museum_algorithm type Procedure101023820.
- British_Museum_algorithm type PsychologicalFeature100023100.
- British_Museum_algorithm type Rule105846932.
- British_Museum_algorithm type YagoPermanentlyLocatedEntity.
- 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 "Algorithme du British Museum".
- British_Museum_algorithm label "British Museum algorithm".
- British_Museum_algorithm label "British Museum-algoritme".
- British_Museum_algorithm label "大英博物館算法".
- 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 Q1068302.
- British_Museum_algorithm sameAs Q1068302.
- British_Museum_algorithm sameAs British_Museum_algorithm.
- British_Museum_algorithm wasDerivedFrom British_Museum_algorithm?oldid=591143330.
- British_Museum_algorithm isPrimaryTopicOf British_Museum_algorithm.