id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
c821gh95k40	Christina M. Maher	On Embeddings of Computable Structures, Classes of Structures and Computable Isomorphism	2010		.txt	text/plain	253	8	39	Logicians have worked on finding the complexity of the isomorphism relation on a class of structures, the classification problem, and categorizing the relative complexity of the isomorphism relation on different classes of structures. One way of comparing the complexity of the classification problem for different classes of structures uses the notion of a Turing computable embedding.	cache/c821gh95k40.txt	txt/c821gh95k40.txt