Related papers: Inside the Muchnik Degrees I: Discontinuity, Learn…
It is hereby established that the set of Lipschitz functions $f:\mathcal{U}\rightarrow \mathbb{R}$ ($\mathcal{U}$ nonempty open subset of $\ell_{d}^{1}$) with maximal Clarke subdifferential contains a linear subspace of uncountable…
Kechris and Louveau showed that each real-valued bounded Baire class 1 function defined on a compact metric space can be written as an alternating sum of a decreasing countable transfinite sequence of upper semi-continuous functions.…
It is well known that the composition of a D-finite function with an algebraic function is again D-finite. We give the first estimates for the orders and the degrees of annihilating operators for the compositions. We find that the analysis…
We develop a systematic algorithmic framework that unites global and local classification problems using index sets. We prove that the classification problem for continuous (binary) regular functions among almost everywhere linear,…
The space of constructible functions form a dense subspace of the space of generalized valuations. In this note we prove a somewhat stronger property that the sequential closure, taken sufficiently many (in fact, infinitely many) times, of…
We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal role in Weihrauch complexity. For one, they can be used as landmarks that characterize important equivalences classes in the…
Motivated by results on generic-case complexity in group theory, we apply the ideas of effective Baire category and effective measure theory to study complexity classes of functions which are "fractionally computable" by a partial…
We introduce and study (metrically) quarter-stratifiable spaces and then apply them to generalize Rudin and Kuratowski-Montgomery theorems about the Baire and Borel complexity of separately continuous functions.
Let $X$ be a locally compact topological space, $(Y,d)$ be a boundedly compact metric space and $LB(X,Y)$ be the space of all locally bounded functions from $X$ to $Y$. We characterize compact sets in $LB(X,Y)$ equipped with the topology of…
We construct an algebra of dimension $2^{\aleph_0}$ consisting only of functions which in no point possess a finite one-sided derivative. We further show that some well known nowhere differentiable functions generate algebras, which contain…
We present two theorems concerned with algorithmic randomness and differentiability of functions of several variables. Firstly, we prove an effective form of the Rademacher's Theorem: we show that computable randomness implies…
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…
Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…
We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
It is obtained necessary and sufficient conditions of dependence on $\aleph$ coordinates for functions of several variables, each of which is a product of metrizable factors. The set of discontinuity points of such functions is…
The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…
We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by affine functions. We obtain similar results for definable…