# 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}
}
• 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

#### References

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

## Computable Structures in Generic Extensions

• Mathematics, Computer Science
• J. Symb. Log.
• 2016

## Feedback Turing Computability, and Turing Computability as Feedback

• Computer Science
• 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
• 2015

## Ordinal machines and admissible recursion theory

• Computer Science, Mathematics
• Ann. Pure Appl. Log.
• 2009

## Higher recursion theory

VIEW 1 EXCERPT

## Uncountable Gandy Ordinals

• Mathematics
• 1976
VIEW 1 EXCERPT

## Classical Descriptive Set Theory

VIEW 1 EXCERPT