{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:51:43Z","timestamp":1764557503685},"reference-count":20,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,1,23]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>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.<\/jats:p>","DOI":"10.1093\/logcom\/exaa002","type":"journal-article","created":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T20:10:54Z","timestamp":1580415054000},"page":"27-60","source":"Crossref","is-referenced-by-count":4,"title":["An introduction to feedback Turing computability"],"prefix":"10.1093","volume":"30","author":[{"given":"Nathanael L","family":"Ackerman","sequence":"first","affiliation":[{"name":"Department of Mathematics, Harvard University, Cambridge, MA 02138, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cameron E","family":"Freer","sequence":"first","affiliation":[{"name":"Computer Science and AI Lab, Massachusetts Institute of Technology, Cambridge, MA 02139, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert S","family":"Lubarsky","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, Florida Atlantic University, Boca Raton, FL 33431, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2020,2,24]]},"reference":[{"key":"2020040702352690300_ref1","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1109\/LICS.2015.55","article-title":"Feedback Turing computability, and Turing computability as feedback","volume-title":"Proceedings of the 30th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2015)","author":"Ackerman","year":"2015"},{"key":"2020040702352690300_ref2","article-title":"Rudiments of $u$-calculus","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"Arnold","year":"2001"},{"key":"2020040702352690300_ref3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible Sets and Structures, Perspectives in Mathematical Logic","author":"Barwise","year":"1975"},{"key":"2020040702352690300_ref4","doi-asserted-by":"crossref","first-page":"567","DOI":"10.2307\/2586556","article-title":"Infinite time Turing machines","volume":"65","author":"Hamkins","year":"2000","journal-title":"The Journal of Symbolic Logic"},{"key":"2020040702352690300_ref5","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1112\/jlms\/jdm022","article-title":"Randomness via effective descriptive set theory","volume":"75","author":"Hjorth","year":"2007","journal-title":"Journal of the London Mathematical Society, Second Series"},{"key":"2020040702352690300_ref6","first-page":"1","article-title":"Recursive functionals and quantifiers of finite types I","volume":"91","author":"Kleene","year":"1959","journal-title":"Transactions of the American Mathematical Society"},{"key":"2020040702352690300_ref7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.2307\/2275338","article-title":"$\\mu$\n            -Definable sets of integers","volume":"58","author":"Lubarsky","year":"1993","journal-title":"The Journal of Symbolic Logic"},{"key":"2020040702352690300_ref8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1515\/9783110324907.341","article-title":"ITTMs with feedback","volume-title":"Ways of Proof Theory","author":"Lubarsky","year":"2010"},{"key":"2020040702352690300_ref9","article-title":"Feedback ITTMs and ${\\varSigma }_3^0$-determinacy","author":"Lubarsky"},{"key":"2020040702352690300_ref10","first-page":"236","article-title":"Parallel feedback Turing computability","volume-title":"Proceedings of LFCS 2016","author":"Lubarsky"},{"key":"2020040702352690300_ref11","volume-title":"Descriptive Set Theory","author":"Moschovakis","year":"1987"},{"key":"2020040702352690300_ref12","first-page":"301","article-title":"Inductive definitions and reflecting properties of admissible ordinals","volume-title":"Generalized Recursion Theory","author":"Richter","year":"1974"},{"key":"2020040702352690300_ref13","volume-title":"Theory of recursive functions and effective computability","author":"Rogers","year":"1967"},{"key":"2020040702352690300_ref14","first-page":"xvi+344","article-title":"Higher recursion theory","volume-title":"Perspectives in Mathematical Logic","author":"Sacks","year":"1990"},{"key":"2020040702352690300_ref15","volume-title":"Theoretische Informatik Kurz Gefa\u00dft","author":"Sch\u00f6ning","year":"1992"},{"key":"2020040702352690300_ref16","doi-asserted-by":"crossref","first-page":"198","DOI":"10.2307\/2270509","article-title":"On analytic well-orderings","volume":"35","author":"Tanaka","year":"1970","journal-title":"Journal of Symbolic Logic"},{"key":"2020040702352690300_ref17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0168-0072(89)90066-3","article-title":"The Galvin\u2013Prikry theorem and set existence axioms","volume":"42","author":"Tanaka","year":"1989","journal-title":"Annals of Pure and Applied Logic"},{"key":"2020040702352690300_ref18","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0168-0072(91)90045-N","article-title":"Weak axioms of determinacy and subsystems of analysis II (${\\varSigma}_2^0$ games)","volume":"52","author":"Tanaka","year":"1991","journal-title":"Annals of Pure and Applied Logic"},{"key":"2020040702352690300_ref19","volume-title":"Logic and Structure","author":"van Dalen","year":"2008"},{"key":"2020040702352690300_ref20","article-title":"$\\textrm{G}_{\\delta \\sigma }$\n            -games and generalized computation","author":"Welch"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/30\/1\/27\/33016588\/exaa002.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/30\/1\/27\/33016588\/exaa002.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T06:35:52Z","timestamp":1586241352000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/30\/1\/27\/5754083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,2,24]]},"published-print":{"date-parts":[[2020,1,23]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exaa002","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2020,1]]},"published":{"date-parts":[[2020,1]]}}}