C.e. and co-c.e. structures and their isomorphism
Valentina Harizanov, GWU
Thu, 21 November, 2013
9:49pm
Abstract: Computable structures and their isomorphisms have been studied extensively in computable structure theory. Here, we investigate the complexity of isomorphisms of computably enumerable (c.e.) and co-computably enumerable (co-c.e.) structures with a single equivalence relation and structures with a single injective function. This is joint work with Doug Cenzer and Jeff Remmel.