Embeddings of Computable Structures

We study what the existence of a classical embedding between computable structures implies about the existence of computable embeddings. In particular, we consider the effect of fixing and varying the computable presentations of the computable structures.

• Type: Journal
• Year: 2010
• Where: NDJFL
• Authors: Asher M. Kach, Oscar Levin, Reed Solomon
• Keywords: Computable, Computable Embeddings, Computable Structures, Computer Networks, NDJFL 2010