Related papers: The computational content of intrinsic density
We prove that certain quotients of entire functions are characteristic functions. Under some conditions, the probability measure corresponding to a characteristic function of that type has a density which can be expressed as a generalized…
Nondegenerate covariance, correlation and spectral density matrices are necessarily symmetric or Hermitian and positive definite. The main contribution of this paper is the development of statistical data depths for collections of Hermitian…
A problem is a multivalued function from a set of \emph{instances} to a set of \emph{solutions}. We consider only instances and solutions coded by sets of integers. A problem admits preservation of some computability-theoretic weakness…
In a large class of statistical inverse problems it is necessary to suppose that the transformation that is inverted is known. Although, in many applications, it is unrealistic to make this assumption, the problem is often insoluble without…
For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…
Let $D$ be a non-empty effective divisor on $\mathbb{P}^1$. We show that when ordered by height, any set of $(D,S)$-integral points on $\mathbb{P}^1$ of bounded degree has relative density zero. We then apply this to arithmetic dynamics:…
This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models. The journey begins with the result that there is a single…
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…
Coarse-grained spin density functional theory (SDFT) is a version of SDFT which works with number/spin densities specified to a limited resolution --- averages over cells of a regular spatial partition --- and external potentials constant…
The notion of probability density for a random function is not as straightforward as in finite-dimensional cases. While a probability density function generally does not exist for functional data, we show that it is possible to develop the…
A new pair of asymptotic invariants for finitely presented groups, called intrinsic and extrinsic tame filling functions, are introduced. These filling functions are quasi-isometry invariants that strengthen the notions of intrinsic and…
High dimensional data can have a surprising property: pairs of data points may be easily separated from each other, or even from arbitrary subsets, with high probability using just simple linear classifiers. However, this is more of a rule…
To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…
We give a complete description of sampling and interpolation in the Bargmann-Fock space, based on a density concept of Beurling. Roughly speaking, a discrete set is a set of sampling if and only if its density in every part of the plane is…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
We define a class of so-called thinnable ideals $\mathcal{I}$ on the positive integers which includes several well-known examples, e.g., the collection of sets with zero asymptotic density, sets with zero logarithmic density, and several…
We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…
Let $\{U_n\}_{n \geqslant 0}$ and $\{G_m\}_{m \geqslant 0}$ be two linear recurrence sequences defined over the integers. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as…
Functional data that are nonnegative and have a constrained integral can be considered as samples of one-dimensional density functions. Such data are ubiquitous. Due to the inherent constraints, densities do not live in a vector space and,…
We conduct a computability-theoretic study of Ramsey-like theorems of the form "Every coloring of the edges of an infinite clique admits an infinite sub-clique avoiding some pattern", with a particular focus on transitive patterns. As it…