Irreducibility is Minimum Synergy Among Parts
Information Theory
2013-12-13 v2 math.IT
Abstract
For readers already familiar with Partial Information Decomposition (PID), we show that PID's definition of synergy enables quantifying at least four different notions of irreducibility. First, we show four common notions of "parts" give rise to a spectrum of four distinct measures of irreducibility. Second, we introduce a nonnegative expression based on PID for each notion of irreducibility. Third, we delineate these four notions of irreducibility with exemplary binary circuits. This work will become more useful once the complexity community has converged on a palatable or measure.
Keywords
Cite
@article{arxiv.1311.7442,
title = {Irreducibility is Minimum Synergy Among Parts},
author = {Virgil Griffith and Jonathan Harel},
journal= {arXiv preprint arXiv:1311.7442},
year = {2013}
}
Comments
15 pages, 6 figures. Only minor changes from v1