Related papers: Taking the path computably travelled
Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…
Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…
Let $\beta: S^{2n+1}\to S^{2n+1}$ be a minimal homeomorphism ($n\ge 1$). We show that the crossed product $C(S^{2n+1})\rtimes_{\beta} \Z$ has rational tracial rank at most one. More generally, let $\Omega$ be a connected compact metric…
This paper contains a classification of countable lower 1-transitive linear orders. The notion of lower 1-transitivity generalises that of 1-transitivity for linear orders, and is essential for the structure theory of 1-transitive trees.…
The notion of computability closure has been introduced for proving the termination of the combination of higher-order rewriting and beta-reduction. It is also used for strengthening the higher-order recursive path ordering. In the present…
We investigate the Baire classification of mappings $f:X\times Y\to Z$, where $X$ belongs to a wide class of spaces, which includes all metrizable spaces, $Y$ is a topological space, $Z$ is an equiconnected space, which are continuous in…
It is shown that under certain stability conditions a complemented subspace of the space $s$ of rapidly decreasing sequences is isomorphic to $s$ and this condition characterizes $s$. This result is used to show that for the classical…
We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the…
We give simple upper bounds for rational sectional category and use them to compute invariants of the type of Farber's topological complexity of rational spaces. In particular we show that the sectional category of formal morphisms reaches…
We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…
This paper concerns the self-similarity of topological spaces, in the sense defined in math.DS/0411344. I show how to recognize self-similar spaces, or more precisely, universal solutions of self-similarity systems. Examples include the…
Unlike Martin-L\"of randomness and Schnorr randomness, computable randomness has not been defined, except for a few ad hoc cases, outside of Cantor space. This paper offers such a definition (actually, several equivalent definitions), and…
Fix integers $a\geq 1$, $b$ and $c$. We prove that for certain projective varieties $V\subset{\bold P}^r$ (e.g. certain possibly singular complete intersections), there are only finitely many components of the Hilbert scheme parametrizing…
A real is called integer-valued random if no integer-valued martingale can win arbitrarily much capital betting against it. A real is low for integer-valued randomness if no integer-valued martingale recursive in A can succeed on an…
Topology may be interpreted as the study of verifiability, where opens correspond to semi-decidable properties. In this paper we make a distinction between verifiable properties themselves and processes which carry out the verification…
We consider classification and regression tasks where we have missing data and assume that the (clean) data resides in a low rank subspace. Finding a hidden subspace is known to be computationally hard. Nevertheless, using a non-proper…
Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…
We show that for spaces $A$ that satisfy a certain smallness condition, there is a Lawvere theory $T_A$ so that a space $X$ has the structure of a $T_A$-algebra if and only if $X$ is weakly equivalent to a mapping space out of $A$. In…
In this paper, we develop a framework for path-planning on abstractions that are not provided to the agent a priori but instead emerge as a function of the available computational resources. We show how a path-planning problem in an…
We carry out the Cantor-Bendixson analysis of the space of all subgroups of any countable abelian group and we deduce a complete classification of such spaces up to homeomorphism.