Towards characterizing the $>\omega^2$-fickle recursively enumerable Turing degrees
Liling Ko

TL;DR
This paper explores the structure of recursively enumerable Turing degrees, aiming to identify lattices that characterize degrees above the level of , and investigates the properties of such lattices and upper semilattices.
Contribution
It introduces new lattices related to levels and examines their embedding properties to characterize higher Turing degrees.
Findings
Identified lattices that characterize levels.
Discovered three lattices besides M_3 that characterize levels.
Conjecture that certain upper semilattices have the same degree characterization as their parent lattices.
Abstract
Given a finite lattice that can be embedded in the recursively enumerable (r.e.) Turing degrees , it is not known how one can characterize the degrees below which can be bounded. Two important characterizations are of the and lattices, where the lattices are bounded below if and only if contains sets of ``\emph{fickleness}'' and respectively. We work towards finding a lattice that characterizes the levels above , the first non-trivial level after . We considered lattices that are as ``short'' and ``narrow'' as and , but the lattices characterize also the or levels, if the lattices are not already embeddable below all non-zero r.e.\ degrees. We also considered upper semilattices (USLs) by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · Cellular Automata and Applications
