Related papers: Computability on quasi-Polish spaces
We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…
The spatiality of derivations of quasi *-algebras is investigated by means of representation theory. Moreover, in view of physical applications, the spatiality of the limit of a family of spatial derivations is considered.
In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…
Being motivated by the famous Kaplansky theorem we study various sequential properties of a Banach space $E$ and its closed unit ball $B$, both endowed with the weak topology of $E$. We show that $B$ has the Pytkeev property if and only if…
"Most" hypersurfaces in projective space are irreducible, and rather precise estimates are known for the probability that a random hypersurface over a finite field is reducible. This paper considers the parametrization of space curves by…
For a metrizable space, we consider the space of all metrics generating the same topology of the metrizable space, and this space of metrics is equipped with the supremum metric. In this paper, for every metrizable space, we establish that…
Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theory, and the other one is a computational notion which is a…
First we extend the theory of subharmonic functions on smooth strictly $k$-analytic curves from Thuillier's thesis to the case of possibly singular analytic curves over a non-archimedean field. Classically psh functions are then defined as…
We investigate relations between symmetrizations of quasi-Banach function spaces and constructions such as Calderon-Lozanovskii spaces, pointwise product spaces and pointwise multipliers. We show that under reasonable assumptions the…
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 completely characterize the sectional curvature of all of the $13$-dimensional Bazaikin spaces. In particular, we show that all Bazaikin spaces admit a quasi-positively curved Riemannian metric, and that, up to isometry, there is a…
We study some topological properties of maximal ideal spaces of certain algebras of almost periodic functions. Our main result is that such spaces are contractible. We present certain corollaries of this result.
We deduce continuity, compactness and invariance properties for quasi-Banach Orlicz modulation spaces. We characterize such spaces in terms of Gabor expansions and by their images under the Bargmann transform.
What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…
We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results…
We introduce a notion of realizability with ordinal Turing machines based on recognizability rather than computability, i.e., the ability to uniquely identify an object. We show that the arising concept of $r$-realizabilty has the property…
Using complex methods combined with Baire's Theorem we show that one-sided extendability, extendability and real analyticity are rare phenomena on various spaces of functions in the topological sense. These considerations led us to…
We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…
We show that the Fr\'echet distance of two-dimensional parametrised surfaces in a metric space is computable in the bit-model of real computation. An analogous result in the real RAM model for piecewise-linear surfaces has recently been…
In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…