Related papers: Non-splittings of speedable sets

We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but we do have an efficient $\eps$-approximation.

Let $\cal R$ be an ordered vector space over an ordered division ring. We prove that every definable set $X$ is a finite union of relatively open definable subsets which are definably simply-connected, settling a conjecture from [5]. The…

A function is boundedly finite-to-one if there is a natural number $k$ such that each point has at most $k$ inverse images. In this paper, we prove in $\mathsf{ZF}$ (i.e., the Zermelo--Fraenkel set theory without the axiom of choice)…

This paper establishes for the first time the predictive performance of speed priors and their computational complexity. A speed prior is essentially a probability distribution that puts low probability on strings that are not efficiently…

A subset of an abelian group is {\em sequenceable} if there is an ordering $(x_1, \ldots, x_k)$ of its elements such that the partial sums $(y_0, y_1, \ldots, y_k)$, given by $y_0 = 0$ and $y_i = \sum_{j=1}^i x_i$ for $1 \leq i \leq k$, are…

The halting problem for Turing machines is decidable on a set of asymptotic probability one. Specifically, there is a set B of Turing machine programs such that (i) B has asymptotic probability one, so that as the number of states n…

Let $G$ be a nonabelian group and $n$ a natural number. We say that $G$ has a strict $n$-split decomposition if it can be partitioned as the disjoint union of an abelian subgroup $A$ and $n$ nonempty subsets $B_1, B_2, \ldots, B_n$, such…

In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

An algorithm is given to factor an integer with $N$ digits in $\ln^m N$ steps, with $m$ approximately 4 or 5. Textbook quadratic sieve methods are exponentially slower. An improvement with the aid of an a particular function would provide a…

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

Suppose $a_n$ is a real, nonnegative sequence that does not increase exponentially. For any $p<1$ we contruct a Lebesgue measurable set $E \subseteq \mathbb{R}$ which has measure at least $p$ in any unit interval and which contains no…

We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

We are concerned with the problem of witnessing the Baire property of the Borel and the projective sets (assuming determinacy) through a sufficiently definable function in the codes. We prove that in the case of projective sets it is…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

We address the separability problem for straight-line string constraints. The separability problem for languages of a class C by a class S asks: given two languages A and B in C, does there exist a language I in S separating A and B (i.e.,…

A set $M$ of nonzero integers is said to split a finite abelian group $G$ if there exists a subset $S\subseteq G$ such that $M\cdot S = G\setminus\{0\}$. Such a splitting is called purely singular if every prime divisor of $|G|$ divides…

The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…