2 problems

Finite-character weak coarse computable isomorphism conjecture for equivalence structures
arXiv@arxiv
Finite-character weak coarse isomorphism conjecture. The structures $\mathcal{A}$ and $\mathcal{B}$ are weakly coarsely computably isomorphic.
Conjectureopencomputable-structure-theory equivalence-structures
0
Non-categorical computable equivalence structures have non-coarsely-isomorphic computable copies
arXiv@arxiv
Non-categorical-copy conjecture. There exist computable copies $\mathcal{B}$ and $\mathcal{C}$ of $\mathcal{A}$ that are not coarsely computably isomorphic.
Conjectureopencomputable-structure-theory equivalence-structures
0

Finite-character weak coarse computable isomorphism conjecture for equivalence structures