相关论文: Computability of topological pressure on compact s…

Let $G,H$ be two countable amenable groups. We introduce the notion of group charts, which gives us a tool to embed an arbitrary $H$-subshift into a $G$-subshift. Using an entropy addition formula derived from this formalism we prove that…

In this work, we study theoretical models of \emph{programmable matter} systems. The systems under consideration consist of spherical modules, kept together by magnetic forces and able to perform two minimal mechanical operations (or…

A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over $\mathbb{N}$ with respect to an ergodic measure $\mu$ equals the asymptotic Kolmogorov complexity of almost every word $\omega$ in X. The purpose of this…

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…

A topological measure on a locally compact space is a set function on open and closed subsets which is finitely additive on the collection of open and compact sets, inner regular on open sets, and outer regular on closed sets. Almost all…

We present a general approach for computing the dynamic partition function of a continuous-time Markov process. The Ruelle topological pressure is identified with the large deviation function of a physical observable. We construct for the…

We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…

A topological space $G$ is said to be a {\it rectifiable space} provided that there are a surjective homeomorphism $\phi :G\times G\rightarrow G\times G$ and an element $e\in G$ such that $\pi_{1}\circ \phi =\pi_{1}$ and for every $x\in G$…

We provide requirements on effectively enumerable topological spaces which guarantee that the Rice-Shapiro theorem holds for the computable elements of these spaces. We show that the relaxation of these requirements leads to the classes of…

We prove some technical results on definable types in $p$-adically closed fields, with consequences for definable groups and definable topological spaces. First, the code of a definable $n$-type (in the field sort) can be taken to be a real…

Topological pressures of the preimages of $\epsilon$-stable sets and some certain closed subsets of stable sets in positive entropy systems are investigated. It is showed that the topological pressure of any topological system can be…

In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…

In this article, we establish the foundations of a computational field theory, which we term Topological Kleene Field Theory (TKFT), inspired by Stephen Kleene's seminal work on partial recursive functions and drawing parallels with…

Computations in Dynamical Triangulation Models of Four-Dimensional Quantum Gravity involve weighted averaging over sets of all distinct triangulations of compact four-dimensional manifolds. In order to be able to perform such computations…

If $\mathcal P$ is a family of filters over some set $I$, a topological space $X$ is \emph{sequencewise $\mathcal P$-\brfrt compact} if, for every $I$-indexed sequence of elements of $X$, there is $F \in \mathcal P$ such that the sequence…

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…

In computable analysis typically topological spaces with countable bases are considered. The Theorem of Kreitz-Weihrauch implies that the subbase representation of a second-countable $T_0$ space is admissible with respect to the topology…

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 closed choice principles for different spaces. Given information about what does not constitute a solution, closed choice determines a solution. We show that with closed choice one can characterize several models of…

Various limit-free formulas are given for the computation of the algebraic and the topological entropy, respectively in the settings of endomorphisms of locally finite discrete groups and of continuous endomorphisms of totally disconnected…