Related papers: The computational content of intrinsic density
One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…
The classical Density Functional Theory (DFT) is introduced as an application of entropic inference for inhomogeneous fluids at thermal equilibrium. It is shown that entropic inference reproduces the variational principle of DFT when…
Consider a log-correlated Gaussian field $\Gamma$ and its associated imaginary multiplicative chaos $:e^{i \beta \Gamma}:$ where $\beta$ is a real parameter. In [AJJ22], we showed that for any nonzero test function $f$, the law of $\int f…
In this article, we prove some subsets of the set of natural numbers $\mathbb{N}$ and any non-zero ideals of an order of imaginary quadratic fields are fractionally dense in $\mathbb{R}_{>0}$ and $\mathbb{C}$ respectively.
Scientific computations or measurements may result in huge volumes of data. Often these can be thought of representing a real-valued function on a high-dimensional domain, and can be conceptually arranged in the format of a tensor of high…
Kernel density estimation is a popular method for estimating unseen probability distributions. However, the convergence of these classical estimators to the true density slows down in high dimensions. Moreover, they do not define meaningful…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…
We compare several definitions of the density of a self-bound system, such as a nucleus, in relation with its center-of-mass zero-point motion. A trivial deconvolution relates the internal density to the density defined in the laboratory…
We introduce a new type of shift dynamics as an extended model of symbolic dynamics, and investigate the characteristics of shift spaces from the viewpoints of both dynamics and computation. This shift dynamics is called a functional shift…
Recent investigations into the physical nature of information and fundamental limits to information transmission have revealed questions such as the possibility of superluminal data transfer or not; and whether reversible computation…
Let $(u_n)_{n \geq 0}$ be a nondegenerate linear recurrence of integers, and let $\mathcal{A}$ be the set of positive integers $n$ such that $u_n$ and $n$ are relatively prime. We prove that $\mathcal{A}$ has an asymptotic density, and that…
We introduce a concept for random tilings which, comprising the conventional one, is also applicable to tiling ensembles without height representation. In particular, we focus on the random tiling entropy as a function of the tile…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
We introduce a notion of a noncommutative function defined on a domain of $d$-tuples of bounded operators on an infinite dimensional Hilbert space. Inverse and implicit function theorems in this setting are established. When these…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
The study deals with the theory of interior capacities of condensers in a locally compact space, a condenser being treated here as a countable, locally finite collection of arbitrary sets with the sign +1 or -1 prescribed such that the…
Some properties of $m$-density points and density-degree functions are studied. Moreover the following main results are provided: \vskip2mm \begin{itemize} \item {\it Let $\lambda$ be a continuous differential form of degree $h$ in…
Let G be a finitely generated group with a given word metric. The asymptotic density of elements in G that have a particular property P is defined to be the limit, as r goes to infinity, of the proportion of elements in the ball of radius r…
A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…