Generically Computable Equivalence Structures and Isomorphisms
Wesley Calvert, Douglas Cenzer, Valentina Harizanov
TL;DR
This paper introduces notions of generic and coarse computability for relations and structures, exploring their existence and uniqueness within equivalence structures.
Contribution
It defines new concepts of generic and coarse computability and applies them to analyze equivalence structures and isomorphisms.
Findings
Existence of generically computable equivalence structures
Uniqueness results for these structures
Framework for analyzing computability in structures
Abstract
We define notions of generically and coarsely computable relations and structures and functions between structures. We investigate the existence and uniqueness of equivalence structures in the context of these definitions
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 · Benford’s Law and Fraud Detection · Cellular Automata and Applications