scientific article; zbMATH DE number 4118351

MaRDI QIDQ4732455zbMATH OpenFDO

Authors Mark Burgin

Publication date 1988

zbMATH Keywords

arithmetical hierarchyarithmetical sethierarchy on the class of super-recursive algorithmsInductive Turing machinesmodels of limiting computations

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Hierarchies of computability and definability (03D55)

Recommendations

• The position of index sets of identifiable sets in the arithmetical hierarchy
• Alternating Turing machines for inductive languages
• Weaker variants of infinite time Turing machines
• ITTMs with feedback
• Logical Approaches to Computational Barriers

Cited in

(11)

• Ordinal machines and admissible recursion theory
• Experience, generations, and limits in machine learning
• Hypercomputation by definition
• A computational glimpse at the Leibniz and Frege hierarchies
• The logic of Turing progressions
• Arithmetization of register machines with counters
• Alternating Turing machines for inductive languages
• The position of index sets of identifiable sets in the arithmetical hierarchy
• scientific article; zbMATH DE number 497572 (Why is no real title available?)
• scientific article; zbMATH DE number 732055 (Why is no real title available?)
• scientific article; zbMATH DE number 3995646 (Why is no real title available?)

This page was built for publication:

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