Computable structure theory of partial combinatory algebras

EB Fokina, SA Terwijn - Conference on Computability in Europe, 2024 - Springer
Computable Structure Theory of Partial Combinatory Algebras | SpringerLink Skip to main
content Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …

Algorithmically finite, universal, and -universal groups

U Andrews, MC Ho - arXiv preprint arXiv:2402.01882, 2024 - arxiv.org
The study of the word problems of groups dates back to Dehn in 1911, and has been a
central topic of study in both group theory and computability theory. As most naturally …

Two results on complexities of decision problems of groups

U Andrews, M Harrison-Trainor, MC Ho - arXiv preprint arXiv …, 2024 - arxiv.org
We answer two questions on the complexities of decision problems of groups, each related
to a classical result. First, C. Miller characterized the complexity of the isomorphism problem …