We show how a concept from animal behavior, the visual search hypothesis, is relevant to complexity considerations in computational vision. In particular we show that this hypothesis is an indication of the validity of the bounded/unbounded visual search distinction proposed by Tsotsos. Specifically we show bounded visual search corresponds to a broad range of naturally occurring, target driven problems in which attention alters the search behavior of animals.
