An introduction to feedback Turing computability

Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky

Abstract: Feedback computability is computation with an oracle that contains the correct convergence/divergence information for all computations calling that same oracle. Here we study feedback Turing computability, as well as feedback for some smaller classes of computation. We also examine some versions of parallelization of these notions.