Work

Algebraic barriers to halving algorithmic information quantities in correlated strings

Year: 2025

Type: article

Abstract: A preliminary version of the paper was published in proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), https://mfcs2025.mimuw.edu.pl/ ; DOI:10.4230/LIPIcs.MFCS.2025.84, https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.84

Source: Information and Computation

DOI: 10.1016/j.ic.2025.105396

Author: Andrei Romashchenko

Language: English

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,840

Funder: Agence Nationale de la Recherche

Award: Fundamental Laws of Information Theory through the Lens of Applications