Content deleted Content added
Possible typo →Work in α recursion |
|||
| (One intermediate revision by the same user not shown) | |||
Line 36:
Barwise has proved that the sets <math>\Sigma_1</math>-definable on <math>L_{\alpha^+}</math> are exactly the sets <math>\Pi_1^1</math>-definable on <math>L_\alpha</math>, where <math>\alpha^+</math> denotes the next admissible ordinal above <math>\alpha</math>, and <math>\Sigma</math> is from the [[Levy hierarchy]].<ref>T. Arai, [https://www.sciencedirect.com/science/article/pii/S0168007203000204 Proof theory for theories of ordinals - I: recursively Mahlo ordinals] (1998). p.2</ref>
There is a generalization of [[Computability in the limit|limit computability]] to partial <math>\alpha\to\alpha</math> functions
A computational interpretation of <math>\alpha</math>-recursion exists, using "<math>\alpha</math>-Turing machines" with a two-symbol tape of length <math>\alpha</math>, that at limit computation steps take the [[limit inferior]] of cell contents, state, and head position. For admissible <math>\alpha</math>, a set <math>A\subseteq\alpha</math> is <math>\alpha</math>-recursive iff it is computable by an <math>\alpha</math>-Turing machine, and <math>A</math> is <math>\alpha</math>-recursively-enumerable iff <math>A</math> is the range of a function computable by an <math>\alpha</math>-Turing machine. <ref>P. Koepke, B. Seyfferth, "[https://www.math.uni-bonn.de/people/koepke/Preprints/Ordinal_machines_and_admissible_recursion_theory.pdf Ordinal machines and admissible recursion theory]". Annals of Pure and Applied Logic vol. 160 (2009), pp.310--318.</ref>
A problem in α-recursion theory which is open (as of 2019) is the embedding conjecture for admissible ordinals, which is whether for all admissible <math>\alpha</math>, the automorphisms of the <math>\alpha</math>-enumeration degrees embed into the automorphisms of the <math>\alpha</math>-enumeration degrees.<ref>D.
==Relationship to analysis==
| |||