Abstract
Paul tries to find an unknown x from l to n by asking q Yes-No questions. In response Carole may lie up to k times. For k fixed and n, q sufficiently large, necessary and sufficient conditions are given for Paul to win.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have