Imagen de Portada

A look at the Kolmogorov complexity of finite groupoids and algebras

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Cardó, Carles
Formato:	Preprint
Publicado:	2023
Materias:	Information Theory 20N02, 68Q30, 03C05
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On semigroups and groupoids with minimal probabilistic spectrum
por: Cardó, Carles
Publicado: (2026)

Arithmetic and $k$-maximality of the cyclic free magma
por: Cardó, Carles
Publicado: (2024)

Equidecomposable magmas
por: Cardó, Carles
Publicado: (2024)

Cubical coherent confluence, $ω$-groupoids and the cube equation
por: Malbos, Philippe, et al.
Publicado: (2025)

Finite model theory for pseudovarieties and universal algebra: preservation, definability and complexity
por: Ham, Lucy, et al.
Publicado: (2022)

On sequential structures in incompressible multidimensional networks
por: Abrahão, Felipe S., et al.
Publicado: (2018)

Probabilistic equational spectrum, primality and approximation in finite algebras
por: Cardó, Carles
Publicado: (2026)

On Chaitin's Heuristic Principle and Halting Probability
por: Salehi, Saeed
Publicado: (2023)

Infinite Eulerian paths are computable on graphs with vertices of infinite degree
por: Carrasco-Vargas, Nicanor
Publicado: (2023)

All Kolmogorov complexity functions are optimal, but are some more optimal?
por: Bauwens, Bruno, et al.
Publicado: (2025)

Extending the Limit Theorem of Barmpalias and Lewis-Pye to all reals
por: Titov, Ivan
Publicado: (2024)

Growth and density in free groupoids
por: Cardó, Carles
Publicado: (2024)

Elementary equivalence of endomorphism rings and automorphism groups of periodic Abelian groups
por: Bunina, Elena
Publicado: (2024)

Linear extensions of finite posets
por: Chan, Swee Hong, et al.
Publicado: (2023)

Why the classes P and NP are not well-defined finitarily
por: Anand, Bhupinder Singh
Publicado: (2024)

Incremental Certificate Learning for Hybrid Neural Network Verification . A Solver Architecture for Piecewise-Linear Safety Queries
por: Gokavarapu, Chandrasekhar
Publicado: (2025)

Optimal sampling for least squares approximation with general dictionaries
por: Trunschke, Philipp, et al.
Publicado: (2024)

Variants of Solovay reducibility
por: Titov, Ivan
Publicado: (2024)

Kakeya Conjecture and Conditional Kolmogorov Complexity
por: Polson, Nicholas G., et al.
Publicado: (2026)

From Gödel incompleteness to the consistency of circuit lower bounds
por: Atserias, Albert, et al.
Publicado: (2026)

Fast and Provable Nonconvex Robust Matrix Completion
por: Fu, Yichen, et al.
Publicado: (2026)

Parametrized complexity of relations between multidimensional subshifts
por: Carrasco-Vargas, Nicanor, et al.
Publicado: (2025)

Heart Disease Detection using Quantum Computing and Partitioned Random Forest Methods
por: Heidari, Hanif, et al.
Publicado: (2022)

Single-set cubical categories and their formalisation with a proof assistant (extended version)
por: Malbos, Philippe, et al.
Publicado: (2024)

Chirality and Racemization on Isotopy Classes of Loops: A Groupoid-Based Structural Theory
por: Inoué, Takao
Publicado: (2026)

On entropic and almost multilinear representability of matroids
por: Kühne, Lukas, et al.
Publicado: (2022)

Effective codescent morphisms of $n$-quasigroups and $n$-loops
por: Zangurashvili, Dali
Publicado: (2024)

Computational complexity of counting coincidences
por: Chan, Swee Hong, et al.
Publicado: (2023)

Simplicity and irreducibility in circular automata
por: Venturi, Riccardo
Publicado: (2025)

Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
por: Roucairol, Milo, et al.
Publicado: (2024)

The Optimality of a Nested Generalized Pairwise Group Testing Procedure
por: Malinovsky, Yaakov, et al.
Publicado: (2025)

Anti-Context-Free languages
por: Cardó, Carles
Publicado: (2024)

Languages of Words of Low Automatic Complexity Are Hard to Compute
por: Chen, Joey, et al.
Publicado: (2025)

Languages given by Finite Automata over the Unary Alphabet
por: Czerwiński, Wojciech, et al.
Publicado: (2023)

Strongly finitary metric monads are too strong
por: Adamek, Jiri
Publicado: (2026)

NIP and Distal Metric Structures
por: Anderson, Aaron
Publicado: (2023)

Building test batteries based on analysing random number generator tests within the framework of algorithmic information theory
por: Ryabko, Boris
Publicado: (2024)

A Theory for Coloring Walks in a Digraph
por: Chaiken, Seth
Publicado: (2024)

An automata-based test for bricks over string algebras
por: Kuber, Amit, et al.
Publicado: (2026)

On the power of linear programming for K-means clustering
por: De Rosa, Antonio, et al.
Publicado: (2024)