Ulam's searching game with a fixed number of lies

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)307-321
Number of pages15
JournalTheoretical Computer Science
Volume95
Issue number2
DOIs
StatePublished - Mar 30 1992

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Ulam's searching game with a fixed number of lies'. Together they form a unique fingerprint.

  • Cite this