Related papers: Analytic computable structure theory and $L^p$-spa…
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…
A computable graph $\mathcal{G}$ is computably categorical relative to a degree $\mathbf{d}$ if and only if for all $\mathbf{d}$-computable copies $\mathcal{B}$ of $\mathcal{G}$, there is a $\mathbf{d}$-computable isomorphism…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
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…
Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.
Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…
We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
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 give a model-theoretic characterization of the class of geometric theories classified by an atomic topos having enough points; in particular, we show that every complete geometric theory classified by an atomic topos is countably…
This paper is devoted to the classification and studying properties of complex unital $3$-dimensional structurable algebras. We provide a complete list of non-isomorphic classes, identifying five algebras for type $(2, 1)$ and two algebras…
We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…
We study the structure of the category of graded, connected, countable-dimensional, commutative and cocommutative Hopf algebras over a perfect field $k$ of characteristic $p$. Every $p$-torsion object in this category is uniquely a direct…
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…
We discuss computability and computational complexity of conformal mappings and their boundary extensions. As applications, we review the state of the art regarding computability and complexity of Julia sets, their invariant measures and…
Let $M$ be a compact hyperkaehler manifold. The hyperkaehler structure equips $M$ with a set $R$ of complex structures parametrized by $CP^1$, called "the set of induced complex structures". It was known previously that induced complex…
A systematic review of the various topologies that can be defined on the projective Hilbert space P(H), i.e., on the set of the pure quantum states, is presented. It is shown that P(H) carries a natural topology as well as a natural…
We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…
We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…