Order-computable sets (Q2469429): Difference between revisions

A set \(A\subseteq\omega\) is called order-computable if the structure \(\langle\omega;<,A\rangle\) has a computable copy. The authors study general properties of order-computable sets, mostly the relationship of this property with Turing degrees. The most impressive result is the fact that there exist computably isomorphic c.e. sets one of which is order-computable and the other is not. Some open questions are formulated.