Algorithmically finite, universal, and *-universal groups

MaRDI QIDQ6520144arXivFDO

Authors Uri Andrews, Meng-Che ``Turbo'' Ho

Mathematics Subject Classification ID

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)