Электронный архив

Просмотр по теме "Computable structure"

Просмотр по теме "Computable structure"

Отсортировать по:Сортировать:Результаты поиска на странице:

  • Fokina E.; Frolov A.; Kalimullin I. (2016)
    © 2016 by University of Notre Dame. For a computable structure M, the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of M. If the spectrum has a ...
  • Fokina E.; Kalimullin I.; Miller R. (2009)
    Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realized as degrees of categoricity. We show that ...

Поиск в электронном архиве

Просмотр

Моя учетная запись