Parallel feedback Turing computability

DOI10.1007/978-3-319-27683-0_17zbMATH Open1476.03053OpenAlexW2296367215MaRDI QIDQ5283431FDOQ5283431

Authors: 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

Recommendations

• An introduction to feedback Turing computability
• Feedback Turing computability, and Turing computability as feedback
• Feedback computability on Cantor space
• On computable numbers, nonuniversality, and the genuine power of parallelism
• Feedback hyperjump

zbMATH Keywords

feedbackparallel computationreflectiondeterminismadmissibilitynon-determinismgap-reflection

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Descriptive set theory
• The Galvin-Prikry theorem and set existence axioms
• Title not available (Why is that?)
• Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
• μ-definable sets of integers
• ITTMs with feedback
• Feedback Turing Computability, and Turing Computability as Feedback
• On analytic well-orderings

Cited In (1)

• Degrees of bi-embeddable categoricity of equivalence structures

This page was built for publication: Parallel feedback Turing computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283431)