On extremum-searching approximate probabilistic algorithms
We give bad (with respect to the reverse inclusion ordering) sequences of monomial ideals in two variables with Ackermannian lengths and extend this to multiple recursive lengths for more variables.
The recursion theoretic limit lemma, saying that each function with a graph is a limit of certain function with a graph, is provable in .