Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Computability Theory has many examples of this. For example, the halting set $K$ is order-isomorphic to $\mathbb{N}$, but there is no computable order-preserving bijection between them.
