Computably Enumerable Equivalence Relations
Su Gao, Peter Gerdes
TL;DR
This paper explores the structure of computably enumerable equivalence relations (ceers) on natural numbers, focusing on a strong reducibility notion and developing a comprehensive theoretical framework.
Contribution
It introduces a detailed structural theory for ceers under a strong reducibility, advancing understanding of their complexity and classification.
Findings
Developed a rich structural theory for ceers.
Analyzed reducibility among ceers.
Provided new classifications and hierarchies.
Abstract
We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.
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.