Related papers: Asymptotic density and the coarse computability bo…

Let $X_1,...,X_n$ be i.i.d. observations, where $X_i=Y_i+\sigma_n Z_i$ and the $Y$'s and $Z$'s are independent. Assume that the $Y$'s are unobservable and that they have the density $f$ and also that the $Z$'s have a known density $k.$…

We show that if a separable space X has a meager open subset containing a copy of the Cantor set 2^\omega, then X has $\frak{c}$ types of countable dense subsets. We suggest a generalization of the \lambda-set for non-separable spaces. Let…

We study the possible growth rates of the Kolmogorov complexity of initial segments of sequences that are random with respect to some computable measure on $2^\omega$, the so-called proper sequences. Our main results are as follows: (1) We…

Inspired by group cohomology, we define several coarse topological invariants of metric spaces. We define the coarse cohomological dimension of a metric space, and demonstrate that if G is a countable group, then the coarse cohomological…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Given a compact subset $\Sigma \subset \mathbb{R}$ (or $\mathbb{C}$) with logarithmic capacity greater than zero, we construct an explicit family of probability measures supported on $\Sigma$ such that their closure is all the possible weak…

Designing capacity-achieving coding schemes for the band-limited additive colored Gaussian noise (ACGN) channel has been and is still a challenge. In this paper, the capacity of the band-limited ACGN channel is studied from a fundamental…

We introduce and study a new topological notion of the size for subsets of the real line, called \emph{super-density}. A set $A\subset\mathbb{R}$ is super-dense if for every non-empty open interval $I$ and every nowhere constant continuous…

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…

This is the first of two papers devoted to connections between asymptotic functions of groups and computational complexity. One of the main results of this paper states that if for every $m$ the first $m$ digits of a real number $\alpha\ge…

We call a subset of an ordinal $\lambda$ recognizable if it is the unique subset $x$ of $\lambda$ for which some Turing machine with ordinal time and tape, which halts for all subsets of $\lambda$ as input, halts with the final state $0$.…

Let (X_R, 0) be a germ of real analytic subset in (R^N, 0) of pure dimension n+1 with an isolated singularity at 0. Let (f_R,0) : (X_R, 0) --> (R,0) a real analytic germ with an isolated singularity at 0, such that its complexification f_C…

The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…

A computable graph $\mathcal{G}$ is computably categorical relative to a degree $\mathbf{d}$ if and only if for all $\mathbf{d}$-computable copies $\mathcal{B}$ of $\mathcal{G}$, there is a $\mathbf{d}$-computable isomorphism…

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…

The celebrated Erd\H{o}s--Stone--Simonovits theorem characterizes the asymptotic maximum edge density in $\mathcal{F}$-free graphs as $1 - 1/(\chi(\mathcal{F})-1) + o(1)$, where $\chi(\mathcal{F})$ is the minimum chromatic number of a graph…

Let $S$ be a Scott set, or even an $\omega$-model of $\mathsf{WWKL}$. Then for each $A\in S$, either there is $X \in S$ that is weakly 2-random relative to $A$, or there is $X\in S$ that is 1-generic relative to $A$. It follows that if…

This paper investigates the Hausdorff measure of certain sets of generics in computability theory. Let $\Gamma$ be the Turing ideal in which we take the dense open sets. The set of $\Gamma$-Cohen generics has measure positive if and only if…

Let $\Gamma$ be a countable discrete group. We say that $\Gamma$ has $C^*$-invariant subalgebra rigidity (ISR) property if every $\Gamma$-invariant $C^*$-subalgebra $\mathcal{A}\le C_r^*(\Gamma)$ is of the form $C_r^*(N)$ for some normal…