The search for a search: Measuring the information cost of higher level search
Graduate studies at Western
|Abstract||Many searches are needle-in-the-haystack problems, looking for small targets in large spaces. In such cases, blind search stands no hope of success. Success, instead, requires an assisted search. But whence the assistance required for a search to be successful? To pose the question this way suggests that successful searches do not emerge spontaneously but need themselves to be discovered via a search. The question then naturally arises whether such a higher-level “search for a search” is any easier than the original search. We prove two results: (1) The Horizontal No Free Lunch Theorem, which shows that average relative performance of searches never exceeds unassisted or blind searches. (2) The Vertical No Free Lunch Theorem, which shows that the difficulty of searching for a successful search increases exponentially compared to the difficulty of the original search.|
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
|External links||This entry has no external links. Add one.|
|Through your library||Only published papers are available at libraries|
Similar books and articles
W. A. Verloren van Themaat (1984). Hindsight and the Definition of Research Success. Journal for General Philosophy of Science 15 (2):272-277.
Dag Elgesem (2008). Search Engines and the Public Use of Reason. Ethics and Information Technology 10 (4):233-242.
Ortrun Ibens (2002). Connection Tableau Calculi with Disjunctive Constraints. Studia Logica 70 (2):241 - 270.
D. Evans (2002). The Search Hypothesis of Emotions. British Journal for the Philosophy of Science 53 (4):497-509.
Uwe Egly & Hans Tompits (2003). On Different Proof-Search Strategies for Orthologic. Studia Logica 73 (1):131 - 152.
Added to index2009-01-28
Total downloads3 ( #213,563 of 739,325 )
Recent downloads (6 months)0
How can I increase my downloads?