Feedback computability on Cantor space

@article{Ackerman2019FeedbackCO,
  title={Feedback computability on Cantor space},
  author={Nathanael L. Ackerman and Cameron E. Freer and Robert S. Lubarsky},
  journal={ArXiv},
  year={2019},
  volume={abs/1708.01139}
}
  • Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky
  • Published 2019
  • Mathematics, Computer Science
  • ArXiv
  • We introduce the notion of feedback computable functions from $2^\omega$ to $2^\omega$, extending feedback Turing computation in analogy with the standard notion of computability for functions from $2^\omega$ to $2^\omega$. We then show that the feedback computable functions are precisely the effectively Borel functions. With this as motivation we define the notion of a feedback computable function on a structure, independent of any coding of the structure as a real. We show that this notion is… CONTINUE READING
    5
    Twitter Mentions

    Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 21 REFERENCES

    Feedback Turing Computability, and Turing Computability as Feedback

    Ordinal machines and admissible recursion theory

    Reflection and forcing in E-recursion theory

    Higher recursion theory

    VIEW 1 EXCERPT

    Infinite Time Turing Machines

    A survey of Mučnik and Medvedev degrees

    Classical Descriptive Set Theory

    VIEW 1 EXCERPT