The search for a search: Measuring the information cost of higher level search
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)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Hindsight and the Definition of Research Success.W. A. Verloren van Themaat - 1984 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 15 (2):272-277.
Search Engines and the Public Use of Reason.Dag Elgesem - 2008 - Ethics and Information Technology 10 (4):233-242.
Connection Tableau Calculi with Disjunctive Constraints.Ortrun Ibens - 2002 - Studia Logica 70 (2):241 - 270.
The Search Hypothesis of Emotions.D. Evans - 2002 - British Journal for the Philosophy of Science 53 (4):497-509.
On Different Proof-Search Strategies for Orthologic.Uwe Egly & Hans Tompits - 2003 - Studia Logica 73 (1):131 - 152.
The Conservation of Information: Measuring the Cost of Successful Search.William Dembski - manuscript
Added to index2009-01-28
Total downloads3 ( #687,692 of 2,153,830 )
Recent downloads (6 months)0
How can I increase my downloads?