An introduction to feedback Turing computability

Nathanael L Ackerman,Cameron E Freer,Robert S Lubarsky

Journal of Logic and Computation（2020）

引用 4|浏览25

暂无评分

摘要

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.

查看译文

关键词

Computability theory,Turing machines,hyperarithmetic computability,least fixed points,parallel computation,feedback,determinism,non-determinism,reflection,gap-reflection,admissibility

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要