2 papers
math.LO2024
Two results on complexities of decision problems of groups
Uri Andrews, Matthew Harrison-Trainor, Meng-Che "Turbo" Ho
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 pro…
math.LO2024
Algorithmically finite, universal, and -universal groups
Uri Andrews, Meng-Che "Turbo" Ho
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 occurrin…