3 problems

Let $e\geq 1$, and let $k_e$ be the minimum integer $k$ such that, for all sufficiently large $m$, Questioner can identify an initially unknown $m$-bit number using a perfect strat…

Nonexistence conjecture. There is no complete total polynomial search problem.

Let $n$ be the number of people in a room, let $s$ be the number of spies, and let $\ell$ satisfy … A questioning strategy is a procedure for asking questions that determines the i…