1993 Reports

Solution of Ulam's Problem on Binary Search with Four Lies

Auletta, Vincenzo; Negro, Alberto; Parlati, Giuseppe

In this paper we determine the minimal number of yes-no queries needed to find an unknown integer between 1 and 1000000 if at most four of the answers may be erroneous.