Mathematical Games Optimal comparison strategies in Ulam's searching game with two errors

Theoretical Computer Science

Volumn 182, Issue 1-2, 1997, Pages 217-232

  Mundici, Daniele ^a   Trombetta, Alberto ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERRORS; THEOREM PROVING;

ULAM'S SEARCHING GAME;

GAME THEORY;

EID: 0031210523     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00030-3     Document Type: Article

References (7)

1. E.R. Berlekamp, Block coding for the binary symmetric channel with feedback, in: H.B. Mann (Ed.,) Error-correcting Codes, Wiley, New York, 1968, pp. 330-335.
2. J. Czyzowicz, D. Mundici, A. Pelc, Ulam's searching game with lies, J. Combinat. Theory, Series A, 52 (1989) 62-76.
3. J.F. Mac Williams, N.J.A. Sloane, The Theory of Error-correcting Codes, 5th ed., North-Holland, Amsterdam, 1986.
4. D. Mundici, Logic of infinite quantum systems, Internat. J. Theoret. Phys. 32 (1993) 1941-1955.
5. A. Pelc, Solution of Ulam's problem on searching with a lie, J. Combinat. Theory Series A, 44 (1987) 129-140.
6. J. Spencer, Ulam's searching game with a fixed number of lies, Theoret. Comput. Sci. 95 (1992) 307-321.
7. S.M. Ulam, Adventures of a Mathematician, Scribner's, New York, 1976.