Computable Structure Theory of Partial Combinatory Algebras
摘要
We discuss the complexity of the class of countable partial combinatory algebras, coded as c.e. sets. We prove a completeness result, and also discuss the complexity of the isomorphism problem.