Related papers: Computability of topological pressure on compact s…
As a variant of the equal entropy cover problem, we ask whether all multidimensional sofic shifts with countably many configurations have SFT covers with countably many configurations. We answer this question in the negative by presenting…
The topological complexity TC(X) is a numerical homotopy invariant of a topological space X which is motivated by robotics and is similar in spirit to the classical Lusternik-Schnirelmann category of X. Given a mechanical system with…
Motivated by the notion of strong computable type for sets in computable analysis, we define the notion of strong computable type for $G$-shifts, where $G$ is a finitely generated group with decidable word problem. A $G$-shift has strong…
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…
We consider three dimensional gravity with a positive cosmological constant and non- zero gravitational Chern-Simons term. This theory has inflating de Sitter solutions and local metric degrees of freedom. The Euclidean signature partition…
Let $X=(X,\mathcal{B},\mu)$ be a $\sigma$-finite measure space and \mbox{$f:X\to X$} be a measurable transformation such that the composition operator $T_f:\varphi\mapsto \varphi\circ f$ is a bounded linear operator acting on…
A common approach for describing classes of functions and probability measures on a topological space $\mathcal{X}$ is to construct a suitable map $\Phi$ from $\mathcal{X}$ into a vector space, where linear methods can be applied to address…
Let $X$ be a compact metric space and $T:X\longrightarrow X$ be continuous. Let $h^*(T)$ be the supremum of topological sequence entropies of $T$ over all subsequences of $\mathbb Z_+$ and $S(X)$ be the set of the values $h^*(T)$ for all…
In this paper, we focus on some properties, calculations and estimations of topological entropy for a nonautonomous dynamical system $(X,f_{0,\infty})$ generated by a sequence of continuous self-maps $f_{0,\infty}=\{f_n\}_{n=0}^{\infty}$ on…
When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel's notion of a mechanistic theory is…
We introduce four, a priori different, notions of topological pressure for possibly discontinuous semiflows acting on compact metric spaces and observe that they all agree with the classical one when restricted to the continuous setting.…
From the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation…
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…
Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…
We study homeomorphisms of compact metric spaces whose restriction to the nonwandering set has the pseudo-orbit tracing property. We prove that if there are positively expansive measures, then the topological entropy is positive. Some short…
Let X be a smooth projective surface over a number field, and $f: X \to X$ an automorphism of positive topological entropy. In this paper, we construct a height function on X that behaves well relative to f and deduce some arithmetic…
We prove that for any topological space $X$ of countable tightness, each \sigma-convex subspace $\F$ of the space $SC_p(X)$ of scatteredly continuous real-valued functions on $X$ has network weight $nw(\F)\le nw(X)$. This implies that for a…
We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $\pi_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length…
In a recent paper, two multi-representations for the measurable sets in a computable measure space have been introduced, which prove to be topologically complete w.r.t. certain topological properties. In this contribution, we show them…
Given a Tychonoff space $X$, let $F(X)$ and $A(X)$ be respectively the free topological group and the free Abelian topological group over $X$ in the sense of Markov. In this paper, we consider two topological properties of $F(X)$ or $A(X)$,…