Graphs are not universal for online computability

Turetsky D.; Melnikov A.; Harrison-Trainor M.; Kalimullin I.; Downey R.

Graphs are not universal for online computability

Downey R.; Harrison-Trainor M.; Kalimullin I.; Melnikov A.; Turetsky D.

URI: https://dspace.kpfu.ru/xmlui/handle/net/160813

Date: 2020

Abstract:

© 2020 Elsevier Inc. We show that structures with only one binary function symbol are universal for “online” (punctual) computable structures. In contrast, we give a description of punctually categorical graphs which implies that graphs are not universal for online computability.

Show full item record

Files in this item

Name: SCOPUS00220000-20 ...

Size: 131.4Kb

Format: PDF

View/Open

This item appears in the following Collection(s)

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