$\mathcal{D}$-maximal sets
Peter Cholak, Peter Gerdes, and Karen Lange

TL;DR
This paper introduces new invariants to classify $$-maximal sets, generalizing maximal sets, and demonstrates that many such sets form infinitely many distinct orbits, deepening understanding of their structure.
Contribution
The paper defines novel invariants for $$-maximal sets and provides a complete classification, revealing that many classes split into infinitely many orbits.
Findings
Some $$-maximal sets are classified into well-understood orbits.
Many classes of $$-maximal sets break into infinitely many orbits.
New invariants effectively distinguish different $$-maximal sets.
Abstract
Soare proved that the maximal sets form an orbit in . We consider here -maximal sets, generalizations of maximal sets introduced by Herrmann and Kummer. Some orbits of -maximal sets are well understood, e.g., hemimaximal sets, but many are not. The goal of this paper is to define new invariants on computably enumerable sets and to use them to give a complete nontrivial classification of the -maximal sets. Although these invariants help us to better understand the -maximal sets, we use them to show that several classes of -maximal sets break into infinitely many orbits.
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
