Graphs are not universal for online computability

Rodney Downey,Matthew Harrison-Trainor,Iskander Kalimullin,Alexander Melnikov,Daniel Turetsky

Journal of Computer and System Sciences（2020）

引用 13|浏览39

暂无评分

摘要

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.

查看译文

关键词

Computability,Logic,Abstract theory of online computation

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要