Related papers: On the incomputability of computable dimension
An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…
The $2n$ dimensional manifold with two mutually commutative operators of differentiation is introduced. Nontrivial multidimensional integrable systems connected with arbitrary graded (semisimple) algebras are constructed. The general…
We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based…
We study the difficulty of computing topological entropy of subshifts subjected to mixing restrictions. This problem is well-studied for multidimensional subshifts of finite type : there exists a threshold in the irreducibility rate where…
In this article, we will show that uncomputability is a relative property not only of oracle Turing machines, but also of subrecursive classes. We will define the concept of a Turing submachine, and a recursive relative version for the Busy…
We introduce the property of countable separation for a locally convex Hausdorff space $X$ and relate it to the existence of a metrizable coarser topology. Building on this, we demonstrate how the separability of $X$ is equivalent to the…
Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…
We study the topology and the Hausdorff dimension of a random Cantor set with overlaps, generated by an iterated function system with scaling ratio equal to the Golden Mean. The results extend known formulas to a case where the Open Set…
We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…
We construct a family of non-PCF dendrites $K$ in a plane, such that in each of them all subarcs have the same Hausdorff dimension $s$, while the set of $s$-dimensional Hausdorff measures of subarcs connecting the given point and a…
A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…
We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
We construct a subring as mentioned in the title (hence this subring has Lebesgue measure zero).
We describe derivations of the Clifford algebra of a nondegenerate quadratic form on a countable dimensional vector space over an algebraically closed field of characteristic not equal to $2$. We also construct an algebraic automorphism of…
Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing…
For the countable discrete amenable group actions, we calculate the mean Hausdorff dimensions of three types of infinite dimensional fractal systems, the self-similar systems, homogeneous systems in the infinite-dimensional torus, and the…
A first-order expansion of the $\mathbb{R}$-vector space structure on $\mathbb{R}$ does not define every compact subset of every $\mathbb{R}^n$ if and only if topological and Hausdorff dimension coincide on all closed definable sets.…
We study the computational content of the Radon-Nokodym theorem from measure theory in the framework of the representation approach to computable analysis. We define computable measurable spaces and canonical representations of the measures…
We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…