Author:
KOH HEER TERN,MELNIKOV ALEXANDER G.,NG KENG MENG
Abstract
Abstract
We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions based on classical notions in the literature. We relate these notions with the well-established definitions of effective presentability for discrete and profinite groups, and compare our results with similar results in computable topology.
Publisher
Cambridge University Press (CUP)