2 problems
- 0 votes0 replies1 view
Generalization of the non-order-reversing embedding theorem for generalized computability models
Let , and let and be the generalized computability models defined in the paper. An embedding i…
- 0 votes0 replies0 views
Embeddings between partial combinatory algebras at successive Turing jumps
Let . Write , , and for the partial combinatory algebras defined in the paper, and write for the Turing jum…