Show simple item record

dc.contributor.author Kalimullin I.S.
dc.contributor.author Selivanov V.L.
dc.contributor.author Frolov A.N.
dc.date.accessioned 2022-02-09T20:36:16Z
dc.date.available 2022-02-09T20:36:16Z
dc.date.issued 2021
dc.identifier.issn 1072-3374
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/169331
dc.description.abstract In this survey, we discuss computability spectra of countable structures that provide a natural measure of non-computability of a structure. This notion is a main tool for investigating algorithmic properties of countable structures. Along with a review of known results in this field, we present proofs of some new results to illustrate the method of interpretation, which is a basic method of the field. We also discuss some open questions.
dc.relation.ispartofseries Journal of Mathematical Sciences (United States)
dc.subject 03C57
dc.subject 03D45
dc.subject computable structure
dc.subject interpretation
dc.subject spectrum of a structure
dc.subject structure
dc.title Degree Spectra of Structures
dc.type Article
dc.relation.ispartofseries-issue 2
dc.relation.ispartofseries-volume 256
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 143
dc.source.id SCOPUS10723374-2021-256-2-SID85107813642


Files in this item

This item appears in the following Collection(s)

  • Публикации сотрудников КФУ Scopus [24551]
    Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics