Related papers: On the incomputability of computable dimension
We continue the investigation of analytic spaces from the perspective of computable structure theory. We show that if $p \geq 1$ is a computable real, and if $\Omega$ is a nonzero, non-atomic, and separable measure space, then every…
Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimulin and Yamaleev. Using the same…
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…
We explore methods for constructing normal forms of indecomposable quiver representations. The first part of the paper develops homological tools for recursively constructing families of indecomposable representations from indecomposables…
We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C^*$ algebras.
Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…
We consider linear mappings on the $d$-dimensional torus, defined by $T(x) = Ax \pmod 1$, where $A$ is an invertible $d \times d$ integer matrix, with no eigenvalues on the unit circle. In the case $d = 2$ and $\det A = \pm 1$, we give a…
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…
In this paper, we first show that for all four non-negative real numbers, there exists a Cantor ultrametric space whose Hausdorff dimension, packing dimension, upper box dimension, and Assouad dimension are equal to given four numbers,…
Computational feasibility is a widespread concern that guides the framing and modeling of biological and artificial intelligence. The specification of cognitive system capacities is often shaped by unexamined intuitive assumptions about the…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…
An ultrametric Cantor set can be seen as the boundary of a rooted weighted tree called the Michon tree. The notion of Assouad dimension is re-interpreted as seen on the Michon tree. The Assouad dimension of an ultrametric Cantor set is…
In this article a collection of random self-similar fractal dendrites is constructed, and their Hausdorff dimension is calculated. Previous results determining this quantity for random self-similar structures have relied on geometrical…
This paper investigates topological reconstruction, related to the reconstruction conjecture in graph theory. We ask whether the homeomorphism types of subspaces of a space $X$ which are obtained by deleting singletons determine $X$…
Fractal sets, by definition, are non-differentiable, however their dimension can be continuous, differentiable, and arithmetically manipulable as function of their construction parameters. A new arithmetic for fractal dimension of polyadic…
The dimension spectrum of a conformal iterated function system (CIFS) is the set of all Hausdorff dimensions of its various subsystem limit sets. This brief note provides two constructions -- (i) a compact perfect set that cannot be…
We consider subsets of the (symbolic) sequence space that are invariant under the action of the semigroup of multiplicative integers. A representative example is the collection of all 0-1 sequences $(x_k)$ such that $x_k x_{2k}=0$ for all…
We show that for a transcendental entire function the set of points whose orbit under iteration is bounded can have arbitrarily small positive Hausdorff dimension.
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…