IDEAS home Printed from https://ideas.repec.org/a/plo/pcbi00/1012323.html
   My bibliography  Save this article

Upper bounds for integrated information

Author

Listed:
  • Alireza Zaeemzadeh
  • Giulio Tononi

Abstract

Originally developed as a theory of consciousness, integrated information theory provides a mathematical framework to quantify the causal irreducibility of systems and subsets of units in the system. Specifically, mechanism integrated information quantifies how much of the causal powers of a subset of units in a state, also referred to as a mechanism, cannot be accounted for by its parts. If the causal powers of the mechanism can be fully explained by its parts, it is reducible and its integrated information is zero. Here, we study the upper bound of this measure and how it is achieved. We study mechanisms in isolation, groups of mechanisms, and groups of causal relations among mechanisms. We put forward new theoretical results that show mechanisms that share parts with each other cannot all achieve their maximum. We also introduce techniques to design systems that can maximize the integrated information of a subset of their mechanisms or relations. Our results can potentially be used to exploit the symmetries and constraints to reduce the computations significantly and to compare different connectivity profiles in terms of their maximal achievable integrated information.Author summary: Integrated Information Theory (IIT) offers a theoretical framework to quantify the causal irreducibilty of a system, subsets of the units in a system, and the causal relations among the subsets. For example, mechanism integrated information quantifies how much of the causal powers of a subset of units in a state cannot be accounted for by its parts. Here, we provide theoretical results on the upper bounds for this measure, how it is achieved, and why mechanisms with overlapping parts cannot all be maximally integrated. We also study the upper bounds for integrated information of causal relations among the mechanisms. The ideas introduced here can potentially pave the way to design systems with optimal causal irreducibility and to develop computationally lightweight exact or approximate measures for integrated information.

Suggested Citation

  • Alireza Zaeemzadeh & Giulio Tononi, 2024. "Upper bounds for integrated information," PLOS Computational Biology, Public Library of Science, vol. 20(8), pages 1-21, August.
  • Handle: RePEc:plo:pcbi00:1012323
    DOI: 10.1371/journal.pcbi.1012323
    as

    Download full text from publisher

    File URL: https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1012323
    Download Restriction: no

    File URL: https://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1012323&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pcbi.1012323?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pcbi00:1012323. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ploscompbiol (email available below). General contact details of provider: https://journals.plos.org/ploscompbiol/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.