Evidence map›Paper›PMID 42352111›Full record

ArticleEntropy (Basel, Switzerland)2026

On the Empirical Agreement Between Compression and Program-Execution Approaches to Algorithmic Complexity: A Controlled Study Using BDM.

Zoe Leyva-Acosta, Eduardo Acuña Yeomans, Francisco Hernández-Quiroz

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Zoe Leyva-AcostaPosgrado en Ciencia e Ingeniería de la Computación, Universidad Nacional Autónoma de México, Mexico City 04510, Mexico.ORCID 0009-0001-1308-5985
Eduardo Acuña YeomansPosgrado en Ciencia e Ingeniería de la Computación, Universidad Nacional Autónoma de México, Mexico City 04510, Mexico.ORCID 0000-0003-0017-0512
Francisco Hernández-QuirozFacultad de Ciencias, Universidad Nacional Autónoma de México, Mexico City 04510, Mexico.ORCID 0000-0002-9748-0201

Funding

Secretaría de Ciencia, Humanidades, Tecnlogía e Innovación 1006614Universidad Nacional Autónoma de México PAPIIT IN11452
6 · The paper itself

Abstract

Algorithmic complexity is a foundational notion in theoretical computer science, but its incomputability has led to two families of practical estimators: compression-based and program-execution-based (e.g., the Coding Theorem Method, CTM). Despite widespread use, the correspondence between these paradigms remains poorly understood. We present a systematic comparative framework that uses the Block Decomposition Method (BDM) to extend CTM-based estimates to longer strings, enabling direct comparison with compression-based estimators across multiple computational models. A control estimator (BDM

Indexed as

algorithmic complexityBlock Decomposition MethodCoding Theorem Methodcompresion-based estimates

Identifiers

PMID42352111
PMCPMC13297901

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.