We present a recursive construction based on the observation that the oracle in Grover's algorithm is itself defined by a decision problem. The oracle must "know" how to decide membership, and this knowledge constitutes a searchable description. By applying Grover's algorithm to search for the oracle's description, and recursively applying this construction, we obtain a hierarchy of meta-algorithms. We show that the query complexity at level $k$ is $O(N^{1/2^{k+1}})$, which converges to $O(1)$ as $k \to \infty$.