相关论文: Many-one reductions and the category of multivalue…

Categories enriched over a commutative unital quantale can be studied as generalized, or many-valued, ordered structures. Because many concepts, such as complete distributivity, in lattice theory can be characterized by existence of certain…

We investigate the uniform computational content of the open and clopen Ramsey theorems in the Weihrauch lattice. While they are known to be equivalent to $\mathrm{ATR_0}$ from the point of view of reverse mathematics, there is not a…

The Weihrauch degrees and strong Weihrauch degrees are partially ordered structures representing degrees of unsolvability of various mathematical problems. Their study has been widely applied in computable analysis, complexity theory, and…

In this paper we study Weihrauch reducibility for multi-valued functions on represented spaces. We call the corresponding equivalence classes Weihrauch degrees and we show that the corresponding partial order induces a lower semi-lattice…

We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…

We introduce two new operations (compositional products and implication) on Weihrauch degrees, and investigate the overall algebraic structure. The validity of the various distributivity laws is studied and forms the basis for a comparison…

In this article, we give a full description of a topological many-one degree structure of real-valued functions, recently introduced by Day-Downey-Westrick. We also point out that their characterization of the Bourgain rank of a Baire-one…

In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this…

Weihrauch reducibility is a notion of reducibility between computational problems that is useful to calibrate the uniform computational strength of a multivalued function. It complements the analysis of mathematical theorems done in reverse…

The unprecedented pace of machine learning research has lead to incredible advances, but also poses hard challenges. At present, the field lacks strong theoretical underpinnings, and many important achievements stem from ad hoc design…

Notions of a "holomorphic" function theory for functions of a split-quaternionic variable have been of recent interest. We describe two found in the literature and show that one notion encompasses a small class of functions, while the other…

We introduce real vector spaces composed of set-valued maps on an open set. They are also complete metric spaces, lattices, commutative rings. The set of differentiable functions is a dense subset of these spaces and the classical gradient…

We present a framework to derive risk bounds for vector-valued learning with a broad class of feature maps and loss functions. Multi-task learning and one-vs-all multi-category learning are treated as examples. We discuss in detail…

Multimodular functions, primarily used in the literature of queueing theory, discrete-event systems, and operations research, constitute a fundamental function class in discrete convex analysis. The objective of this paper is to clarify the…

We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…

The Weihrauch degrees are a tool to gauge the computational difficulty of mathematical problems. Often, what makes these problems hard is their discontinuity. We look at discontinuity in its purest form, that is, at otherwise constant…

The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…

In 2023 in (3), Uwe finds the explicit form of the map which is which is settled in ZN of finite functional degree and14 discusses how to compute its usual degree w.r.t to the derivative in the linear form, i.e. the product of ones formed…

In this work, we study vector-valued functional equations with multiple recursive terms that arise naturally when we are dealing with vector-valued multiplicative Lindley-type recursions. We provide a detailed framework for the solution of…

We introduce a complete many-valued semantics for basic normal lattice-based modal logic. This relational semantics is grounded on many-valued formal contexts from Formal Concept Analysis. We discuss an interpretation and possible…