Parallel Feedback Turing Computability

DOI10.1007/978-3-319-27683-0_17zbMath1476.03053OpenAlexW2296367215MaRDI QIDQ5283431

Robert S. Lubarsky

Publication date: 21 July 2017

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27683-0_17

zbMATH Keywords

determinismreflectionfeedbackparallel computationadmissibilitynon-determinismgap-reflection

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Inductive definability (03D70)

Related Items (1)

Degrees of bi-embeddable categoricity of equivalence structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
• The Galvin-Prikry theorem and set existence axioms
• Feedback Turing Computability, and Turing Computability as Feedback
• μ-definable sets of integers
• On analytic well-orderings

This page was built for publication: Parallel Feedback Turing Computability