We study the fine structure of the classification of sets of natural n
umbers A according to the number of queries which are needed to comput
e the n-fold characteristic function of A. A complete characterization
is obtained, relating the question to finite combinatorics. In order
to obtain an explicit description we consider several interesting comb
inatorial problems. (C) 1995 Academic Press, Inc.