Relative Complexity for Computable Representations of the Conventional Linear Order on the Set of Naturals

In the present article, we study the relationship between computable representations of the set of naturals with the conventional linear order. Two reducibility relations are introduced on the set of all such representations. Each of these relations determines a certain partially ordered set of degrees. We consider some questions concerning the algebraic structure of these posets and the interlocation of various degrees.