2 problems
- 0 votes0 replies0 views
Non-embedding conjecture for pairs of ordinal orders
For a linear order , write for its reverse, and let denote computable embeddability between pairs of structures. The preceding results establish computable…
- 0 votes0 replies0 views
A topological learnability conjecture for computable embeddings
The paper studies the degree and computable embeddings between pairs of countable linear orders. A class of structures is learnable when a le…