Related papers: On the computability of rotation sets and their en…
For $r \in [0,1]$ we say that a set $A \subseteq \omega$ is \emph{coarsely computable at density} $r$ if there is a computable set $C$ such that $\{n : C(n) = A(n)\}$ has lower density at least $r$. Let $\gamma(A) = \sup \{r : A \hbox{ is…
We consider systems made of autonomous mobile robots evolving in highly dynamic discrete environment i.e., graphs where edges may appear and disappear unpredictably without any recurrence, stability, nor periodicity assumption. Robots are…
We study a simple generalization of the rotation (or circular shift) of the binary sequences. In particular, we show each orbit of this generalized rotation has a certain statistical symmetry. This generalized rotation naturally arises when…
Reversible computation is an unconventional form of computing that extends the standard forward-only mode of computation with the ability to execute a sequence of operations in reverse at any point during computation. As such, in this…
We prove a general lower bound of quantum decision tree complexity in terms of some entropy notion. We regard the computation as a communication process in which the oracle and the computer exchange several rounds of messages, each round…
Motivated by the question whether a round disk can be realized as the rotation set of a torus diffeomorphism, we study the roundness of rotation sets of a parametric family of torus diffeomorphisms $F_\rho$, where the parameter $\rho$…
Computational pseudorandomness studies the extent to which a random variable $\bf{Z}$ looks like the uniform distribution according to a class of tests $\cal{F}$. Computational entropy generalizes computational pseudorandomness by studying…
We exhibit an explicit full measure class of minimal interval exchange maps T for which the cohomological equation $\Psi -\Psi\circ T=\Phi$ has a bounded solution $\Psi$ provided that the datum $\Phi$ belongs to a finite codimension…
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…
We discuss the properties of invariant measures corresponding to iterated function systems (IFSs) with place-dependent probabilities and compute their Renyi entropies, generalized dimensions, and multifractal spectra. It is shown that with…
We consider continuous, translation-commuting transformations of compact, translation-invariant families of mappingsfrom finitely generated groups into finite alphabets. It is well-known that such transformations and spaces can be described…
A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…
Let $\cal{N}=\{1,\cdots,n\}$. The entropy function $\bf h$ of a set of $n$ discrete random variables $\{X_i:i\in\cal N\}$ is a $2^n$-dimensional vector whose entries are ${\bf{h}}({\cal{A}})\triangleq H(X_{\cal{A}}),\cal{A}\subset{\cal N}…
Let $f : X\to X$ be a dominating meromorphic map on a compact K\"ahler manifold $X$ of dimension $k$. We extend the notion of topological entropy $h^l_{\mathrm{top}}(f)$ for the action of $f$ on (local) analytic sets of dimension $0\leq l…
In this work we develop a new criterion for the existence of topological horseshoes for surface homeomorphisms in the isotopy class of the identity. Based on our previous work on forcing theory, this new criterion is purely topological and…
For oscillatory functions on local fields coming from motivic exponential functions, we show that integrability over $Q_p^n$ implies integrability over $F_p ((t))^n$ for large $p$, and vice versa. More generally, the integrability only…
Not all approximations arise from information systems. The problem of fitting approximations, subjected to some rules (and related data), to information systems in a rough scheme of things is known as the \emph{inverse problem}. The inverse…
We derive new characterisations of the matrix $\mathrm{\Phi}$-entropy functionals introduced in [Electron.~J.~Probab., 19(20): 1--30, 2014]. Notably, all known equivalent characterisations of the classical $\Phi$-entropies have their matrix…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…