We investigate computability-theoretic properties of computable structures with single unary functions f such that, for every x in the image, f−1(x) has exactly two elements, which we call 2:1 structures. We also investigate structures for which f−1(x) has either exactly two or zero elements, which we call (2,0):1 structures. In particular, we are interested in the complexity of isomorphisms be...