{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:38:00Z","timestamp":1753889880318,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:00:00Z","timestamp":1556582400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:00:00Z","timestamp":1556582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:00:00Z","timestamp":1556582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>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 absolute, and as an example characterize those functions that are computable from a Gandy ordinal with some finite subset distinguished.<\/jats:p>","DOI":"10.23638\/lmcs-15(2:7)2019","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:33:30Z","timestamp":1743701610000},"source":"Crossref","is-referenced-by-count":0,"title":["Feedback computability on Cantor space"],"prefix":"10.23638","volume":"Volume 15, Issue 2","author":[{"given":"Nathanael L.","family":"Ackerman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cameron E.","family":"Freer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert S.","family":"Lubarsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2019,4,30]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1708.01139v5","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1708.01139v5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:33:30Z","timestamp":1743701610000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/3834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,30]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-15(2:7)2019","relation":{"has-preprint":[{"id-type":"arxiv","id":"1708.01139v4","asserted-by":"subject"},{"id-type":"arxiv","id":"1708.01139v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1708.01139v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1708.01139","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1708.01139","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2019,4,30]]},"article-number":"3834"}}