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

Πηγή: Entropy, Vol 28, Iss 6, p 601 (2026)

Θεματικοί όροι: algorithmic complexity, Coding Theorem Method, Block Decomposition Method, compresion-based estimates, Science, Astrophysics, QB460-466, Physics, QC1-999

Περιγραφή αρχείου: electronic resource

Relation: https://www.mdpi.com/1099-4300/28/6/601; https://doaj.org/toc/1099-4300

Σύνδεσμος πρόσβασης: https://doaj.org/article/092bc7a87fdd4eb79029d542d76afd56

An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity

Συγγραφείς: Zoe Leyva-Acosta, Eduardo Acuña Yeomans, Francisco Hernandez-Quiroz

Πηγή: Entropy, Vol 26, Iss 9, p 802 (2024)

Θεματικοί όροι: algorithmic complexity, Kolmogorov complexity, coding theorem method, complexity approximation, Science, Astrophysics, QB460-466, Physics, QC1-999

Relation: https://www.mdpi.com/1099-4300/26/9/802; https://doaj.org/toc/1099-4300; https://doaj.org/article/0a3aaae290604bf1b86c3aaab24147b6

Διαθεσιμότητα: https://doi.org/10.3390/e26090802
https://doaj.org/article/0a3aaae290604bf1b86c3aaab24147b6

Implementacija, evaluacija te trenutni limiti algoritma uzročnog dekonvoluiranja podataka i mreža

Συγγραφείς: Marić, Nikola

Συνεισφορές: Brčić, Mario

Θεματικοί όροι: coding theorem method, metoda dekompozicije blokova, algorithmic complexity, TEHNIČKE ZNANOSTI. Računarstvo, Kolmogorov complexity, uzročno dekonvoluiranje, algoritamska složenost, TECHNICAL SCIENCES. Computing, kompleksnost podataka, causal deconvolution, data complexity, Kolmogorovljeva složenost, metoda teorema kodiranja, block decomposition method

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://repozitorij.fer.unizg.hr/islandora/object/fer:12521/datastream/PDF
https://repozitorij.fer.unizg.hr/islandora/object/fer:12521
https://urn.nsk.hr/urn:nbn:hr:168:910349

Algorithmic complexity for psychology: a user-friendly implementation of the coding theorem method

Συγγραφείς: Gauvrit, Nicolas, Singmann, Henrik, Soler-Toscano, Fernando, Zenil, Hector

Πηγή: Behavior Research Methods. March 2016 48(1):314-329

A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions

Συγγραφείς: Hector Zenil

Πηγή: Entropy ; Volume 22 ; Issue 6 ; Pages: 612

Θεματικοί όροι: algorithmic complexity, Kolmogorov complexity, practical feasibility, Lempel–Ziv–Welch (LZW), Shannon entropy, lossless compression, coding theorem method, causality v correlation, block decomposition method, rebuttal to Paul Vitányi’s review

Περιγραφή αρχείου: application/pdf

Relation: Complexity; https://dx.doi.org/10.3390/e22060612

Διαθεσιμότητα: https://doi.org/10.3390/e22060612