CATEGORICAL COMPLEXITY
نویسندگان
چکیده
منابع مشابه
Categorical Complexity
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 examples of this new definition in categories of wide common interest, such as finite sets, Boolean functions, topological spaces, vector spaces, graded algeb...
متن کاملA Categorical Setting for Lower Complexity
A polarized strong category consists of a cartesian category, X, and a category Y, together with a module M : X × Y −→ Y equipped with a strong composition and identities. These categories can be used to provide an abstract setting for investigating computational setting with complexity below primitive recursive. This paper develops the theory of polarized strong categories, explains how they r...
متن کاملComplexity bounds from abstract categorical models
Common category theory notions are useful for abstracting both semantics and programs, simplifying definitions and aiding reasoning. We argue that categorical descriptions can also be used to reason about program complexity. We calculate complexity bounds from the axioms of abstract category theory structures commonly used in programming and semantics, which imply opportunities for optimisation...
متن کاملComputability and Complexity of Categorical Structures
We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by categories. Since there are infinitary constructions in category theory, it is shown that category theory is strictly more powerful than Turing machines. In ...
متن کاملOn the complexity of inducing categorical and quantitative association rules
Inducing association rules is one of the central tasks in data mining applications. Quantitative association rules induced from databases describe rich and hidden relationships to be found within data that can prove useful for various application purposes (e.g., market basket analysis, customer profiling, and others). Although association rules are quite widely used in practice, a thorough anal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Forum of Mathematics, Sigma
سال: 2020
ISSN: 2050-5094
DOI: 10.1017/fms.2020.26