2025/01/27 by Joey Lakerdas-Gayle, Lakerdas-Gayle, Joey
Computer Science · #Computability, Logic, AI Algorithms #Cellular Automata and Applications
paper · pdf · doi:10.48550/arxiv.2501.16586
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree d is the degree of categoricity of a computable structure M and is not the strong degree of categoricity of any computable structure, then M has a pair of computable copies whose isomorphism spectrum is not finitely generated. Motivated by this result, we introduce a class of computable structures called computably composite structures with the property that the isomorphisms between arbitrary computable copies of these structures are exactly the unions of isomorphisms between the computable copies of their components. We use this to show that any computable union of isomorphism spectra is also an isomorphism spectrum. In particular, this gives examples of isomorphism spectra that are not finitely generated.