scientific article; zbMATH DE number 1390284

MaRDI QIDQ4934571zbMATH OpenFDO

Authors Philip D. Welch

Publication date 13 June 2000

zbMATH Keywords

admissibility theoryconstructible hierarchyinfinite time Turing machinejump hierarchyinfinite time Turing degreesKP-models

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Turing machines and related notions (03D10) Inner models, including constructibility, ordinal definability, and core models (03E45)

Recommendations

• Eventually infinite time Turing machine degrees: infinite time decidable reals
• Infinite time extensions of Kleene's \({\mathcal O}\)
• Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
• The Length of Infinite Time Turing Machine Computations
• Minimality in the Δ⅓-degrees

Cited in

(2)

• Infinite-time Turing machines and Borel reducibility
• The recognizability strength of infinite time Turing machines with ordinal parameters

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 Q4934571)