Order-computable sets (Q2469429)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Order-computable sets |
scientific article |
Statements
Order-computable sets (English)
0 references
5 February 2008
0 references
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.
0 references
order-computable set
0 references
computably enumerable set
0 references
computable structure
0 references
computable order
0 references
limit computable set
0 references
Ershov's hierarchy
0 references
