Algorithmic compression of empirical data: reply to Twardy, Gardner, and Dowe |
| |
Authors: | James W. McAllister |
| |
Affiliation: | Faculty of Philosophy, University of Leiden, PO Box 9515, 2300 RA Leiden, The Netherlands |
| |
Abstract: | This discussion note responds to objections by Twardy, Gardner, and Dowe to my earlier claim that empirical data sets are algorithmically incompressible. Twardy, Gardner, and Dowe hold that many empirical data sets are compressible by Minimum Message Length technique and offer this as evidence that these data sets are algorithmically compressible. I reply that the compression achieved by Minimum Message Length technique is different from algorithmic compression. I conclude that Twardy, Gardner, and Dowe fail to establish that empirical data sets are algorithmically compressible. |
| |
Keywords: | Algorithmic compression Algorithmic randomness Empirical data Huffman compression Minimum Message Length technique |
本文献已被 ScienceDirect 等数据库收录! |
|