Computability, Logic, AI Algorithms Peer reviewed

Type-2 feedback computability

JP Aguilera, M Soto

Computability | Oct 27, 2026

Scollr summary

What this paper is about

It is proved that the sets of integers semi-computable this way are precisely those Σ 1 -definable over L α I and L σ 1 1 , respectively, where α I denotes the least recursively inaccessible ordinal and σ 1 1 the least Σ 1 1 -reflecting ordinal.

Full abstract

Read the full abstract

Feedback computability studies oracles that provide convergence and divergence information about computability relative to that same oracle. We consider strict and loose forms of feedback computability relative to Kleene’s 2 E , the Type-2 object embodying quantification over natural numbers. We prove that the sets of integers semi-computable this way are precisely those Σ 1 -definable over L α I and L σ 1 1 , respectively, where α I denotes the least recursively inaccessible ordinal and σ 1 1 the least Σ 1 1 -reflecting ordinal. Furthermore, our construction of higher-type feedback computability through ordinal inductive fix-points serves as a natural and general framework for the study of feedback computability.

Direct answer

What can I do from this paper page?

Use this page to scan "Type-2 feedback computability" quickly: start with the summary and abstract, then check the authors, source, topics, and related papers. From here, open Scollr to follow Computability, Logic, AI Algorithms research, save the paper, or map adjacent work.

Authors

Researchers on this paper

JP Aguilera

first | TU Wien

M Soto

last | Universitat de Barcelona

Research areas

Follow related topics

Citation

BibTeX

@article{Aguilera2026Type,
  title = {Type-2 feedback computability},
  author = {JP Aguilera and M Soto},
  journal = {Computability},
  year = {2026},
  doi = {10.1177/22113568251320077},
  url = {https://doi.org/10.1177/22113568251320077}
}

FAQ

Using this paper in a discovery workflow

How do I find related work for this paper?

Use the related papers and topic links on this page as starting points. In Scollr, you can also open the paper and build a literature map around its references, citing papers, and related work.

How can I keep up with new Computability, Logic, AI Algorithms research papers?

Follow Computability, Logic, AI Algorithms research in Scollr. New papers from the topic flow into a personalized feed, and you can save useful studies to revisit later.

Can I cite this paper from this page?

This page includes a static BibTeX block for Type-2 feedback computability. Always verify the DOI, source, and publication details against the publisher record before submitting a manuscript.

Follow this research in Scollr

Follow the topics and authors behind this paper, save useful studies, and build a literature map when you are ready to go deeper.

Get the app