Related papers: Effective zero-dimensionality for computable metri…
The stability theory of compact metric spaces with positive topological dimension is a well-established area in Dynamical Systems. A central result, attributed to Walters, connects the concepts of topological stability and the shadowing…
We show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime. More precisely, we establish a dimensional characterization of…
We provide a detailed study of two properties of spaces and pairs of spaces, the surjection property and the epsilon-surjection property, that were recently introduced to characterize the notion of computable type arising from computability…
A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…
Multidimensional cosmological models with $n~(n > 1)$ Einstein spaces are discussed classically and with respect to canonical quantization. These models are integrable in the case of Ricci flat internal spaces. For negative curvature of the…
Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…
A compactness of the Revuz map is established in the sense that the locally uniform convergence of a sequence of positive continuous additive functionals is derived in terms of their smooth measures. To this end, we first introduce a metric…
In spaces of metrics, we investigate topological distributions of the doubling property, the uniform disconnectedness, and the uniform perfectness, which are the quasi-symmetrically invariant properties appearing in the David--Semmes…
A metric tree ($M$, $d$), also known as $\mathbb{R}$-trees or $T$-theory, is a metric space such that between any two points there is an unique arc and that arc is isometric to an interval in $\mathbb{R}$. In this paper after presenting…
The first aim of this study is to define soft sequential compact metric spaces and to investigate some important theorems on soft sequential compact metric space. Second is to introduce net and totally bounded soft metric space and study…
In this paper motivated from subspace coding we introduce subspace-metric codes and subset-metric codes. These are coordinate-position independent pseudometrics and suitable for the folded codes. The half-Singleton upper bounds for linear…
We compare three notions of effectiveness on uncountable structures. The first notion is that of a $\real$-computable structure, based on a model of computation proposed by Blum, Shub, and Smale, which uses full-precision real arithmetic.…
A large literature specifies conditions under which the information complexity for a sequence of numerical problems defined for dimensions $1, 2, \ldots$ grows at a moderate rate, i.e., the sequence of problems is tractable. Here, we focus…
We study the properties of topological spaces $(X,\tau)$, where $X$ is a definable set in an o-minimal structure and the topology $\tau$ on $X$ has a basis that is (uniformly) definable. Examples of such spaces include the canonical…
In this paper we look at normed spaces of differentiable functions on compact plane sets, including the spaces of infinitely differentiable functions originally considered by Dales and Davie. For many compact plane sets the classical…
Building on our prior work on axiomatization of exact real computation by formalizing nondeterministic first-order partial computations over real and complex numbers in a constructive dependent type theory, we present a framework for…
In computable analysis testing a real number for being zero is a fundamental example of a non-computable task. This causes problems for division: We cannot ensure that the number we want to divide by is not zero. In many cases, any real…
A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact…
We generalize our recent method for constructing Killing tensors of the second rank to conformal Killing tensors. The method is intended for foliated spacetimes of arbitrary dimension $m$, which have a set of conformal Killing vectors. It…
We consider various collections of functions from the Baire space X into itself naturally arising in (effective) descriptive set theory and general topology, including computable (equivalently, recursive) functions, contraction mappings,…