Abstract: We show that any recursively enumerable subset of a data structure can be regarded as the solution set to a B??hm-out problem.