Image de couverture de livre

An additively optimal interpreter for approximating Kolmogorov prefix complexity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Leyva-Acosta, Zoe, Yeomans, Eduardo Acuña, Hernandez-Quiroz, Francisco
Format:	Preprint
Publié:	2024
Sujets:	Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Space-bounded online Kolmogorov complexity is additive
par: Bauwens, Bruno, et autres
Publié: (2025)

Worst-case optimal adaptive alphabetic prefix-free coding
par: Gagie, Travis
Publié: (2021)

All Kolmogorov complexity functions are optimal, but are some more optimal?
par: Bauwens, Bruno, et autres
Publié: (2025)

Coding methods for string reconstruction from erroneous prefix-suffix compositions
par: Chen, Zitan
Publié: (2025)

Reconstruction of multiple strings of constant weight from prefix-suffix compositions
par: Yang, Yaoyu, et autres
Publié: (2024)

Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution
par: Abrahão, Felipe S., et autres
Publié: (2024)

Kolmogorov complexity as a combinatorial tool
par: Shen, Alexander
Publié: (2024)

Kolmogorov--Nagumo Mean Frameworks for Conditional Entropy
par: Kamatsuka, Akira, et autres
Publié: (2026)

Infinite families of optimal and minimal codes over rings using simplicial complexes
par: Wu, Yanan, et autres
Publié: (2024)

High-probability sample complexities for policy evaluation with linear function approximation
par: Li, Gen, et autres
Publié: (2023)

A look at the Kolmogorov complexity of finite groupoids and algebras
par: Cardó, Carles
Publié: (2023)

Highly-sensitive measure of complexity captures boolean networks regimes and temporal order more optimally
par: Luevano, Manuel de J., et autres
Publié: (2024)

Neural Weight Norm = Kolmogorov Complexity
par: Musat, Tiberiu
Publié: (2026)

On the existence of Ulanowicz's optimal structural resilience in complex networks
par: Wei, Si-Yao, et autres
Publié: (2026)

Kolmogorov-Loveland betting strategies lose the Betting game on open sets
par: Petrović, Tomislav
Publié: (2024)

Computing efficiently a parity-check matrix for Zps-additive codes
par: Fernández-Córdoba, Cristina, et autres
Publié: (2024)

Quantifying coherence with quantum addition
par: Mukhopadhyay, Chiranjib, et autres
Publié: (2018)

Secret sharing with additive access structures from correlated random variables
par: Miller, David, et autres
Publié: (2026)

The geometry of intersecting codes and applications to additive combinatorics and factorization theory
par: Borello, Martino, et autres
Publié: (2024)

Is star complexity a proxy for information based complexity of graphs?
par: Standish, Russell K.
Publié: (2025)

An additive refinement of quantum channel capacities
par: Wang, D. -S.
Publié: (2022)

On Eisenstein additive codes over chain rings and linear codes over mixed alphabets
par: Jose, Leijo, et autres
Publié: (2024)

Is speckle noise more challenging to mitigate than additive noise?
par: Malekian, Reihaneh, et autres
Publié: (2024)

The complexity of elliptic normal bases
par: Panario, Daniel, et autres
Publié: (2024)

Information entropy of complex probability
par: Li, Chan, et autres
Publié: (2025)

$\mathbb{F}_q\mathbb{F}_{q^2}$-additive cyclic codes and their Gray images
par: Yadav, Ankit, et autres
Publié: (2025)

On polycyclic linear and additive codes associated to a trinomial over a finite chain ring
par: Chibloun, Abdelghaffar, et autres
Publié: (2025)

On the best approximation by finite Gaussian mixtures
par: Ma, Yun, et autres
Publié: (2024)

The entropic doubling constant and robustness of Gaussian codebooks for additive-noise channels
par: Gavalakis, Lampros, et autres
Publié: (2024)

Order-theoretic models for decision-making: Learning, optimization, complexity and computation
par: Hack, Pedro
Publié: (2024)

A leave-one-out approach to approximate message passing
par: Bao, Zhigang, et autres
Publié: (2023)

Gaussian random projections of convex cones: approximate kinematic formulae and applications
par: Han, Qiyang, et autres
Publié: (2022)

On the Performance of Low-complexity Decoders of LDPC Codes
par: Peng, Qingqing, et autres
Publié: (2024)

Low-complexity Voronoi shaping for the Gaussian channel
par: Li, S., et autres
Publié: (2021)

The Kolmogorov Complexity of Irish traditional dance music
par: McGettrick, Michael, et autres
Publié: (2024)

Total/dual correlation/coherence, redundancy/synergy, complexity, and O-information for real and complex valued multivariate data
par: Pascual-Marqui, Roberto D., et autres
Publié: (2025)

The Construction of Near-optimal Universal Coding of Integers
par: Yan, Wei, et autres
Publié: (2025)

A class of optimal authentication codes with secrecy
par: Liu, Haibo, et autres
Publié: (2026)

Understanding the ratio of the partition sum to its Bethe approximation via double covers
par: Vontobel, Pascal O.
Publié: (2025)

Sharp regret-Hellinger bounds for Gaussian empirical Bayes via polynomial approximation
par: Chen, Jiafeng, et autres
Publié: (2026)