COMPUTABLE TOPOLOGICAL GROUPS
Copyright policy )COMPUTABLE TOPOLOGICAL GROUPS
AbstractWe 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.
- Nanyang Technological University Singapore
- Victoria University of Wellington New Zealand
Birkhoff-Kakutani theorem, Applications of computability and recursion theory, Polish groups, computable groups, FOS: Mathematics, 03D78 (Primary), Mathematics - Logic, right-c.e. Polish presentation, Logic (math.LO), topological groups
Birkhoff-Kakutani theorem, Applications of computability and recursion theory, Polish groups, computable groups, FOS: Mathematics, 03D78 (Primary), Mathematics - Logic, right-c.e. Polish presentation, Logic (math.LO), topological groups
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!