An adversary selects an integer k
from the set of non-negative integers.
Does any algorithm exist that, using only tests for equality or inequality (<, =, >), is guaranteed to find k
in finite time?
An adversary selects an integer k
from the set of non-negative integers.
Does any algorithm exist that, using only tests for equality or inequality (<, =, >), is guaranteed to find k
in finite time?