An introduction to feedback Turing computability-Reference-Cited by-同舟云学术

An introduction to feedback Turing computability

Published:2020-01 Issue:1 Volume:30 Page:27-60
ISSN:0955-792X
Container-title:Journal of Logic and Computation
language:en
Short-container-title:

Author:

Ackerman Nathanael L¹,Freer Cameron E²,Lubarsky Robert S³

Affiliation:

1. Department of Mathematics, Harvard University, Cambridge, MA 02138, USA

2. Computer Science and AI Lab, Massachusetts Institute of Technology, Cambridge, MA 02139, USA

3. Department of Mathematical Sciences, Florida Atlantic University, Boca Raton, FL 33431, USA

Abstract

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.

Publisher

Oxford University Press (OUP)

Subject

Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science

Link

http://academic.oup.com/logcom/article-pdf/30/1/27/33016588/exaa002.pdf

Reference20 articles.

1. Feedback Turing computability, and Turing computability as feedback;Ackerman,2015

2. Rudiments of $u$-calculus;Arnold,2001

3. Admissible Sets and Structures

4. Infinite time Turing machines;Hamkins;The Journal of Symbolic Logic,2000

5. Randomness via effective descriptive set theory;Hjorth;Journal of the London Mathematical Society, Second Series,2007

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Higher-Order Feedback Computation;Lecture Notes in Computer Science;2024

2. A characterization of Σ11-reflecting ordinals;Annals of Pure and Applied Logic;2021-12

3. Feedback hyperjump;Journal of Logic and Computation;2021-01