A set A is autoreducible if one can compute, for all x, the value A(x) by querying A only at places y 6= x. Furthermore, A is infinitely-often autoreducible if, for infinitely many x, the value A(x) can be computed by querying A only at places y 6= x. For all other x, the computation outputs a special symbol to signal that the reduction is undefined. It is shown that for polynomial time Turing ...
