Generically and coarsely computable isomorphisms
From MaRDI portal
Publication:5061389
DOI10.3233/COM-210382MaRDI QIDQ5061389
Douglas Cenzer, Wesley Calvert, Valentina S. Harizanov
Publication date: 12 January 2023
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/com-210382
isomorphism; equivalence structure; coarsely computable; generically computable; injection structure
03Dxx: Computability and recursion theory
Related Items
Cites Work
- Unnamed Item
- \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures
- Generic-case complexity, decision problems in group theory, and random walks.
- Computability-theoretic properties of injection structures
- Effective categoricity of equivalence structures
- Generic computability, Turing degrees, and asymptotic density
- Asymptotic Density and the Theory of Computability: A Partial Survey
- Equivalence structures and isomorphisms in the difference hierarchy
- Densely computable structures
- Asymptotic density and the Ershov hierarchy
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS