Related papers: Computability of Pressure for Subshifts on Countab…
Given a countable sofic group $\Gamma$, a finite alphabet $A$, a subshift $X \subseteq A^\Gamma$, and a potential $\phi: X \to \mathbb{R}$, we give sufficient conditions on $X$ and $\phi$ for expressing, in the uniqueness regime, the sofic…
In this short note, for countably infinite amenable group actions, we provide topological proofs for the following results: Bowen topological entropy (dimensional entropy) of the whole space equals the usual topological entropy along…
A sofic approximation to a countable group is a sequence of partial actions on finite sets that asymptotically approximates the action of the group on itself by left-translations. A group is sofic if it admits a sofic approximation. Sofic…
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can…
We extend the definition of topological pressure to locally compact Hausdorff spaces, and we demonstrate a "variational principle" comparing the topological and measure theoretic pressures. Given a continuous $\mathbb{Z}_+^N$-action $T$…
Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…
This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…
In this paper, we introduce the notions of lowerable, D-lowerable, P-lowerable, hereditarily lowerable, and hereditarily uniformly lowerable for countably infinite amenable group actions. We show that a system with finite entropy is…
Given an equilibrium state $\mu$ for a continuous function $f$ on a shift of finite type $X$, the pressure of $f$ is the integral, with respect to $\mu$, of the sum of $f$ and the information function of $\mu$. We show that under certain…
The goal of this paper is to define and investigate those topological pressures, which is an extension of topological entropy presented by Feng and Huang [13], of continuous transformations. This study reveals the similarity between many…
We prove that a topologically predictable action of a countable amenable group has zero topological entropy, as conjectured by Hochman. On route, we investigate invariant random orders and formulate a unified Kieffer-Pinsker formula for the…
In this work, we prove that every SFT, sofic shift, and strongly irreducible shift on locally finite groups has strong dynamical properties. These properties include that every sofic shift is an SFT, every SFT is strongly irreducible, every…
We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…
We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…
It is widely known that when $X$ is compact Hausdorff, and when $T: X \to X$ and $f: X \to \mathbb{R}$ are continuous, \begin{equation*} P(T,f) = \sup_{\text{$\mu$: Radon probability}} \left( h_\mu(T) + \int f\, \mathrm{d}\mu \right),…
In this thesis, we provide an initial investigation into bounds for topological entropy of switched linear systems. Entropy measures, roughly, the information needed to describe the behavior of a system with finite precision on finite time…
In this paper we are interested in computability aspects of subshifts and in particular Turing degrees of 2-dimensional SFTs (i.e. tilings). To be more precise, we prove that given any \pizu subset $P$ of $\{0,1\}^\NN$ there is a SFT $X$…
Let $X$ be a compact metric space and $\Phi=\{\varphi_t\}_{t\in\mathbb{R}}$ be a continuous flow on $X$. We introduce two types of topological pressure for family of discontinuous potentials $a=\{a_t\}_{t>0}$. First, define the topological…