5 papers
Computable Bases
Vasco Brattka, Emmanuel Rauzy
In computable analysis typically topological spaces with countable bases are considered. The Theorem of Kreitz-Weihrauch implies that the subbase representation of a second-countab…
Effective bases and notions of effective second countability in computable analysis
Vasco Brattka, Emmanuel Rauzy
We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider co…
A robust family of residually finite groups; spectra of residual finiteness growth, computability properties, and other applications (with an appendix by Arman Darbinyan and Emmanuel Rauzy)
Arman Darbinyan, Emmanuel Rauzy
In this paper, we introduce a family of residually finite groups that helps us to systematically study the residual finiteness growth function (RFG) from various perspectives. Firs…
Computable analysis on the space of marked groups
Emmanuel Rauzy
We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on th…
New definitions in the theory of Type 1 computable topological spaces
Emmanuel Rauzy
In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the…