Related papers: Computable analysis on the space of marked groups
This thesis addresses Pour-El and Richards' fourth question from their book "Computability in analysis and physics", concerning the relation between higher order recursion theory and computability in analysis. Among other things it is shown…
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 idea that "computably open sets should be computable unions…
The famous Banach-Mazur problem, which asks if every infinite-dimensional Banach space has an infinite-dimensional separable quotient Banach space, has remained unsolved for 85 years, though it has been answered in the affirmative for…
In this paper we address the question: How many pairwise non-isomorphic extremely amenable groups are there which are separable metrizable or even Polish? We show that there are continuum many such groups. In fact we construct continuum…
Real-life agents seldom have unlimited reasoning power. In this paper, we propose and study a new formal notion of computationally bounded strategic ability in multi-agent systems. The notion characterizes the ability of a set of agents to…
This book offers to study locally compact groups from the point of view of appropriate metrics that can be defined on them, in other words to study "Infinite groups as geometric objects", as Gromov writes it in the title of a famous…
We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…
We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…
Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…
Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…
What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…
In this paper we explore the connections between the class of Visibly Pushdown Languages ($\mathbf{VPL}$) and the natural sets of words one can associate to a finitely generated group. We show that the word problem of a finitely generated…
We show some basic results on the characterization of quasi-Polish spaces in terms of spaces of ideals, with an emphasis on the connections with computable topology.
We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated…
The study of the word problems of groups dates back to Dehn in 1911, and has been a central topic of study in both group theory and computability theory. As most naturally occurring presentations of groups are recursive, their word problems…
Countably infinite groups (with a fixed underlying set) constitute a Polish space $G$ with a suitable metric, hence the Baire category theorem holds in $G$. We study isomorphism invariant subsets of $G$, which we call group properties. We…
We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…
In this paper we investigate the extent to which the Lov\'asz Local Lemma (an important tool in probabilistic combinatorics) can be adapted for the measurable setting. In most applications, the Lov\'asz Local Lemma is used to produce a…
We investigate the computability-theoretic properties of valued fields, and in particular algebraically closed valued fields and $p$-adically closed valued fields. We give an effectiveness condition, related to Hensel's lemma, on a valued…
We characterize coset spaces of topological groups which are coset spaces of (separable) metrizable groups and complete metrizable (Polish) groups. Besides, it is shown that for a $G$-space $X$ with a $d$-open action there is a topological…