Related papers: Inside the Muchnik Degrees I: Discontinuity, Learn…
We answer two questions from {\it V.Bykov, On Baire class one functions on a product space, Topol. Appl. {199} (2016) 55--62,} and prove that every Baire one function on a subspace of a countable perfectly normal product is the pointwise…
We define a family of three related reducibilities, $\leq_T$, $\leq_{tt}$ and $\leq_m$, for arbitrary functions $f,g:X\rightarrow\mathbb R$, where $X$ is a compact separable metric space. The $\equiv_T$-equivalence classes mostly coincide…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
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…
For a Tychonoff space $X$, we will denote by $USC_{p}(X)$ ($B_1(X)$) a set of all real-valued upper semicontinuous functions (a set of all Baire functions of class 1) defined on $X$ endowed with the pointwise convergence topology. In this…
By the sometimes so-called 'Main Theorem' of Recursive Analysis, every computable real function is necessarily continuous. We wonder whether and which kinds of HYPERcomputation allow for the effective evaluation of also discontinuous…
We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…
In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…
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…
We give a number of formal proofs of theorems from the field of computable analysis. Many of our results specify executable algorithms that work on infinite inputs by means of operating on finite approximations and are proven correct in the…
A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…
In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…
We study closed choice principles for different spaces. Given information about what does not constitute a solution, closed choice determines a solution. We show that with closed choice one can characterize several models of…
This paper presents categorical formulations of Turing, Medvedev, Muchnik, and Weihrauch reducibilities in Computability Theory, utilizing Lawvere doctrines. While the first notions lend themselves to a smooth categorical presentation,…
It is studied a connection between the separability and the countable chain condition of spaces with the $L$-property (a topological space $X$ has the $L$-property if for every topological space $Y$, separately continuous function…
Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the picture in theoretical circles. This paper concerns instruction sequences, the behaviours produced by them under execution, the interaction…
This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared…
This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…
We construct uncountably generated algebras inside the following sets of special functions: Sierpi\'nski-Zygmund functions, perfectly everywhere surjective functions and nowhere continuous Darboux functions. All conclusions obtained in this…