Related papers: Analytic computable structure theory and $L^p$ spa…
For each countable ordinal $\alpha$, we introduce an ideal $conv_\alpha$ and use it to characterize the class of all compact countable spaces which are homeomorphic to the space $\omega^{\alpha}\cdot n+1$ with the order topology. The…
Given a countable structure $\mathcal{A}$, the degree spectrum of $\mathcal{A}$ is the set of all Turing degrees which can compute an isomorphic copy of $\mathcal{A}$. One of the major programs in computable structure theory is to determine…
We call a function constructible if it has a globally subanalytic domain and can be expressed as a sum of products of globally subanalytic functions and logarithms of positively-valued globally subanalytic functions. For any $q > 0$ and…
This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the following topics: computable ordinals, satisfaction of computable infinitary formulas, forcing as a construction…
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…
For a separable rearrangement invariant space $X$ on $[0,1]$ of fundamental type we identify the set of all $p\in [1,\infty]$ such that $\ell^p$ is finitely represented in $X$ in such a way that the unit basis vectors of $\ell^p$ ($c_0$ if…
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…
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 show that if a separable space X has a meager open subset containing a copy of the Cantor set 2^\omega, then X has $\frak{c}$ types of countable dense subsets. We suggest a generalization of the \lambda-set for non-separable spaces. Let…
We investigate the computability of the isomorphism set $\operatorname{Iso}(G_A,G_B)$ between $G_A$ and $G_B$, where $G_A$ is a subgroup of $\mathbb{Q}^n$ generated by columns of integer powers of a non-singular $n \times n$-matrix $A$ with…
We introduce a class of monotone $\sigma$-complete effect algebras, called representable, which are $\sigma$-homomorphic images of a class of monotone $\sigma$-complete effect algebras of functions taking values in the interval $[0,1]$ and…
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…
L^p spaces of mappings taking values in arbitrary metric spaces, which we call nonlinear Lebesgue spaces, play an important role in several fields of mathematics. For instance, membership in these spaces is typically required for transport…
We present algebraic techniques to analyze state space models in the areas of structural identifiability, observability, and indistinguishability. While the emphasis is on surveying existing algebraic tools for studying ODE systems, we also…
A topological space $X$ is cometrizable if it admits a weaker metrizable topology such that each point $x\in X$ has a (not necessarily open) neighborhood base consisting of metrically closed sets. We study the relation of cometrizable…
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…
The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…
In Quantum Physics, a measurement is represented by a projection on some closed subspace of a Hilbert space. We study algebras of operators that abstract from the algebra of projections on closed subspaces of a Hilbert space. The properties…
We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…
We introduce the notion of feedback computable functions from $2^\omega$ to $2^\omega$, extending feedback Turing computation in analogy with the standard notion of computability for functions from $2^\omega$ to $2^\omega$. We then show…