Related papers: Computability of Pressure for Subshifts on Countab…

There has been much interest in generalizing Kesten's criterion for amenability in terms of a random walk to other contexts, such as determining amenability of a deck covering group by the bottom of the spectrum of the Laplacian or entropy…

Let $r\geq 2$ and $(X_i,G)$ $(i=1,\cdots,r)$ be topological dynamical systems with $G$ being an infinite discrete amenable group. Suppose that $\pi_i:(X_i,G)\to (X_{i+1},G)$ are factor maps and $0\leq w_i\leq 1$. In this article, for $f\in…

Deterministic one-way time-bounded multi-counter automata are studied with respect to their ability to perform reversible computations, which means that the automata are also backward deterministic and, thus, are able to uniquely step the…

In this paper we introduce the notion of scale pressure and measure theoretic scale pressure for amenable group actions. A variational principle for amenable group actions is presented. We also describe these quantities by pseudo-orbits.…

For a given topological dynamical system $(X,T)$ over a compact set $X$ with a metric $d$, the "variational principle" states that \begin{equation*} \sup_{\mu}h_\mu(T) = h(T) = h_d(T), \end{equation*} where $h_\mu(T)$ is the…

We study the computational and structural aspects of countable two-dimensional SFTs and other subshifts. Our main focus is on the topological derivatives and subpattern posets of these objects, and our main results are constructions of…

We prove that given a computable metric space and two computable measures, the set of points that have high universal uniform test scores with respect to the first measure will have a lower bound with respect to the second measure. This…

Rigorous mathematical foundations of density functional theory are revisited, with some use of infinitesimal (nonstandard) methods. A thorough treatment is given of basic properties of internal energy and ground-state energy functionals…

In this article we call a sequence $(a_n)_n$ of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function $r:\mathbb{N}\to\mathbb{N}$ the sequence $(d(a_{r(n+1)},a_{r(n)}))_n$ converges…

Let $(X,\rho,G)$ be a $G-$action topological system, where $G$ is a countable infinite discrete amenable group and $X$ a compact metric space. We prove a variational principle for topological entropy of saturated sets for systems which have…

We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.

We prove that for any infinite countable amenable group $G$, any $\epsilon > 0$ and any finite subset $K\subset G$, there exists a tiling (partition of $G$ into finite "tiles" using only finitely many "shapes"), where all the tiles are $(K;…

We construct Z^2-SFTs at every computable level of the hierarchy of topological completely positive entropy (TCPE), answering Barbieri and Garc\'{i}a-Ramos, who asked if there was one at level 3. Furthermore, we show the property of TCPE in…

In this paper we present an introduction to the area of computability in dynamical systems. This is a fairly new field which has received quite some attention in recent years. One of the central questions in this area is if relevant…

Consider a H\"older continuous potential $\phi$ defined on the full shift $A^\nn$, where $A$ is a finite alphabet. Let $X\subset A^\nn$ be a specified sofic subshift. It is well-known that there is a unique Gibbs measure $\mu_\phi$ on $X$…

We introduce computable actions of computable groups and prove the following versions of effective Birkhoff's ergodic theorem. Let $\Gamma$ be a computable amenable group, then there always exists a canonically computable tempered two-sided…

We consider ground states of quantum spin chains with symmetry-protected topological (SPT) order as resources for measurement-based quantum computation (MBQC). We show that, for a wide range of SPT phases, the computational power of ground…

For a locally compact sofic group continuously acting on a compact metric space, we first study the relative sofic entropy and prove an additive inequality relating sofic entropy and relative sofic entropy. Moreover, it is shown that the…

The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…

We study the topological entropy of hom tree-shifts and show that, although the topological entropy is not a conjugacy invariant for tree-shifts in general, it remains invariant for hom tree higher block shifts. In…