Algorithmically finite, universal, and *-universal groups
From MaRDI portal
Publication:6520144
arXiv2402.01882MaRDI QIDQ6520144FDOQ6520144
Meng-Che ``Turbo Ho, Uri Andrews
Hierarchies of computability and definability (03D55) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40)
This page was built for publication: Algorithmically finite, universal, and $*$-universal groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6520144)