• Computable categoricity of graphs with finite components

      Csima, B; Khoussainov, B; Liu, J (Springer Berlin / Heidelberg, 2008)
      A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably categorical graphs. We restrict ourselves to ...