当前位置: X-MOL 学术J. Comput. Syst. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Graphs are not universal for online computability
Journal of Computer and System Sciences ( IF 1.1 ) Pub Date : 2020-03-13 , DOI: 10.1016/j.jcss.2020.02.004
Rodney Downey , Matthew Harrison-Trainor , Iskander Kalimullin , Alexander Melnikov , Daniel Turetsky

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.



中文翻译:

图形不是通用的在线可计算性

我们证明了只有一个二进制函数符号的结构对于“在线”(准时)可计算结构是通用的。相反,我们对准时分类图进行了描述,这暗示了图对于在线可计算性不是通用的。

更新日期:2020-03-13
down
wechat
bug