Related papers: Asymptotic Density and Computably Enumerable Sets
This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same…
Given a natural number $k\ge 2$ and a $k$-automatic set $S$ of natural numbers, we show that the lower density and upper density of $S$ are recursively computable rational numbers and we provide an algorithm for computing these quantities.…
We start by an introduction to the basic concepts of computability theory and the introduction of the concept of Turing machine and computation universality. Then se turn to the exploration of trade-offs between different measures of…
We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including sublinear and nonlinear codes. We focus on the general setting of finite translation-invariant metric…
It is known that the asymptotic density of states of a 2d CFT in an irreducible representation $\rho$ of a finite symmetry group $G$ is proportional to $(\dim\rho)^2$. We show how this statement can be generalized when the symmetry can be…
Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized…
The thin set theorem $\mathsf{RT}^n_{<\infty,\ell}$ asserts the existence, for every $k$-coloring of the subsets of natural numbers of size $n$, of an infinite set of natural numbers, all of whose subsets of size $n$ use at most $\ell$…
We define $\Psi$-autoreducible sets given an autoreduction procedure $\Psi$. Then, we show that for any $\Psi$, a measurable class of $\Psi$-autoreducible sets has measure zero. Using this, we show that classes of cototal, uniformly…
In this m\'emoire we study quasiperiodic cocycles in semi-simple compact Lie groups. For the greatest part of our study, we will focus ourselves to one-frequency cocyles. We will prove that $C^{\infty}$ reducible cocycles are dense in the…
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…
The set of indices that correspond to the positive entries of a sequence of numbers is called its positivity set. In this paper, we study the density of the positivity set of a given linear recurrence sequence, that is the question of how…
In this paper we shall relate computational complexity to the principle of natural selection. We shall do this by giving a philosophical account of complexity versus universality. It seems sustainable to equate universal systems to complex…
When $p$ is a computable real so that $p \geq 1$, the isometry degree of a computable copy $\mathcal{B}$ of $\ell^p$ is defined to be the least powerful Turing degree that computes a linear isometry of $\ell^p$ onto $\mathcal{B}$. We show…
We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is $\bf{0^{(\alpha)}}$ for…
We show that in the setting of fair-coin measure on the power set of the natural numbers, each sufficiently random set has an infinite subset that computes no random set. That is, there is an almost sure event $\mathcal A$ such that if…
We study the geometry of germs of definable (semialgebraic or subanalytic) sets over a $p$-adic field from the metric, differential and measure geometric point of view. We prove that the local density of such sets at each of their points…
We propose a definition of microcanonical and canonical statistical ensembles based on the concept of density of states. This definition applies both to the classical and the quantum case. For the microcanonical case this allows for a…
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…
Assembly theory (AT) quantifies selection using the assembly equation and identifies complex objects that occur in abundance based on two measurements, assembly index and copy number, where the assembly index is the minimum number of…
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…