Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:Levin_search
|
| gptkbp:category |
gptkb:search_engine
meta-algorithm |
| gptkbp:describes |
A theoretically optimal algorithm for searching for solutions to computational problems
|
| gptkbp:field |
gptkb:artificial_intelligence
computer science algorithmic information theory |
| gptkbp:influenced |
gptkb:AIXI
universal artificial intelligence |
| gptkbp:inventedBy |
gptkb:Leonid_Levin
|
| gptkbp:limitation |
large constant factor makes it impractical for most real-world problems
|
| gptkbp:notablePublication |
Universal Search Problems (1973) by Leonid Levin
|
| gptkbp:property |
guarantees finding a solution if one exists
runs in time at most a constant factor slower than the fastest algorithm for the problem |
| gptkbp:purpose |
solve search problems efficiently
|
| gptkbp:relatedTo |
gptkb:Kolmogorov_complexity
gptkb:universal_Turing_machine gptkb:Solomonoff_induction algorithmic probability |
| gptkbp:yearProposed |
1973
|
| gptkbp:bfsParent |
gptkb:Algorithmic_Information_Theory
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Levin's universal search
|