| RUS ENG |
| Full version |
|
|
|
| SEMINARS |
|
Computable linear orders and linearly ordered structures
|
|||
|
|
|||
|
Algorithmic properties of relations on computable linear orders A. N. Frolov |
|||
|
Abstract: In this talk we consider some natural relations and their modifications on computable linear orders. There are some their proper Turing complexity. We show some connections such relations with initial segments of computable linear orders. |
|||