Related papers: Computability of topological pressure on compact s…

This article continues the study of computable elementary topology started by the author and T. Grubba in 2009 and extends the author's 2010 study of axioms of computable separation. Several computable T3- and Tychonoff separation axioms…

Completeness for a (topological) space is often based on the existence of special structures (such as metrics, uniformities, proximities, convergences, etc) that explicitly induce the topology, making the completeness induction-dependent.…

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…

Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…

Multifractal analysis studies level sets of asymptotically defined quantities in a topological dynamical system. We consider the topological pressure function on such level sets, relating it both to the pressure on the entire phase space…

An $\omega_1$-compact space is a space in which every closed discrete subspace is countable. We give various general conditions under which a locally compact, $\omega_1$-compact space is $\sigma$-countably compact, i.e., the union of…

Given a represented space (in the sense of TTE theory), an appropriate representation is constructed for the Moschovakis extension of its carrier (with paying attention to the cases of effective topological spaces and effective metric…

We study approximation schemes for shift spaces over a finite alphabet using (pseudo)metrics connected to Ornstein's $\bar{d}$ metric. This leads to a class of shift spaces we call $\bar{d}$-approachable. A shift space…

We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions in the literature. We relate these notions with the well-established definitions of effective…

Finding better solutions to combinatorial optimization problems could have a large positive impact on many real-world application areas, such as logistics. For this reason, significant efforts have been made to design novel optimisation…

We provide a topological classification of locally constant functions over subshifts of finite type via their zero-temperature measures. Our approach is to analyze the relationship between the distribution of the zero-temperature measures…

Let $\pi:X\to Y$ be a factor map, where $(X,T)$ and $(Y,S)$ are topological dynamical systems. Let ${\bf a}=(a_1,a_2)\in {\Bbb R}^2$ with $a_1>0$ and $a_2\geq 0$, and $f\in C(X)$. The ${\bf a}$-weighted topological pressure of $f$, denoted…

A topological space $X$ is defined to have a neighborhood $P$-base at any $x\in X$ from some poset $P$ if there exists a neighborhood base $(U_p[x])_{p\in P}$ at $x$ such that $U_p[x]\subseteq U_{p'}[x]$ for all $p\geq p'$ in $P$. We prove…

We investigate the topological properties of Berkovich analytifications over hybrid fields, that is a field equipped with the maximum of its native norm and the trivial norm. We prove that the analytification of the affine line or of a…

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

In this paper, we present finite topological type theorems for open manifolds with non-negative Ricci curvature, under almost maximal local rewinding volume. Unlike previous related research, our theorems remove the constraints of sectional…

Subshifts are sets of colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissible completions. Since soficity of $\mathbb{Z}$ subshifts is…

In conformal field theory (CFT) on simply connected domains of the Riemann sphere, the natural conformal symmetries under self-maps are extended, in a certain way, to local symmetries under general conformal maps, and this is at the basis…

In finite volume the partition function of QCD with a given $\theta$ is a sum of different topological sectors with a weight primarily determined by the topological susceptibility. If a physical observable is evaluated only in a fixed…

In this paper we give a framework for describing how abstract systems can be used to compute if no randomness or error is involved. Using this we describe a class of classical "physical" computation systems whose computational capabilities…