Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Ulam's_searching_problem
|
| gptkbp:category |
gptkb:mathematical_games
search problems |
| gptkbp:describes |
A search problem involving finding an unknown number from a set using yes-no questions, with a limited number of allowed lies.
|
| gptkbp:field |
gptkb:combinatorics
gptkb:information_theory |
| gptkbp:notablePublication |
gptkb:Rényi,_A._(1961)._On_a_problem_of_information_theory._MTA_Mat._Kut._Int._Közl.
gptkb:Yao,_A._C._(1986)._On_the_Ulam–Rényi_game._Discrete_Mathematics. |
| gptkbp:notableSolutionBy |
gptkb:Peter_Elias
gptkb:Richard_Karp gptkb:Alfréd_Rényi gptkb:Andrew_Yao |
| gptkbp:proposedBy |
gptkb:Stanislaw_Ulam
|
| gptkbp:relatedTo |
error-correcting codes
game theory binary search |
| gptkbp:yearProposed |
1940
|
| gptkbp:bfsParent |
gptkb:Hyers–Ulam_stability
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Ulam's 1940 problem
|