CoChat

Mechanism Integrated Information

Open access
Barbosa, Leonardo S., Marshall, William, Albantakis, Larissa, Tononi, Giulio · 2021 · Entropy

The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.

Abstract

The Integrated Information Theory (IIT) of consciousness starts from essential phenomenological properties, which are then translated into postulates that any physical system must satisfy in order to specify the physical substrate of consciousness. We recently introduced an information measure (Barbosa et al., 2020) that captures three postulates of IIT—existence, intrinsicality and information—and is unique. Here we show that the new measure also satisfies the remaining postulates of IIT—integration and exclusion—and create the framework that identifies maximally irreducible mechanisms. These mechanisms can then form maximally irreducible systems, which in turn will specify the physical substrate of conscious experience.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/e23030362

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure A1 Comparison between earth mover’s distance (EMD) and ID. Using the same system S used in Figure 4a, we find the cause purview with maximum integrated information for the mechanism M={A,B} in state m={↑,↑}, which is larger when using the EMD measure (a) when compared to the ID measure (b). The integrated information when using the EMD measure is also larger than the ID measure.
Figure A1 Comparison between earth mover’s distance (EMD) and ID. Using the same system S used in Figure 4a, we find the cause purview with maximum integrated information for the mechanism M={A,B} in state m={↑,↑}, which is larger when using the EMD measure (a) when compared to the ID measure (b). The integrated information when using the EMD measure is also larger than the ID measure.CC BY · PubMed Central
Figure 1 Theory. (a) System S with four random variables. (b) Example of a mechanism M={A,C} in state m={↑,↑} constraining a cause purview Z={B} and an effect purview Z={B,D}. Dashed lines show the partitions. The bar plots show the probability distributions, that is the cause repertoire (left) and effect repertoire (right). The black bars show the probabilities when the mechanism is constraining the purview, and the white bars show the probabilities after partitioning the mechanism.
Figure 1 Theory. (a) System S with four random variables. (b) Example of a mechanism M={A,C} in state m={↑,↑} constraining a cause purview Z={B} and an effect purview Z={B,D}. Dashed lines show the partitions. The bar plots show the probability distributions, that is the cause repertoire (left) and effect repertoire (right). The black bars show the probabilities when the mechanism is constraining the purview, and the white bars show the probabilities after partitioning the mechanism.CC BY · PubMed Central
Figure 2 Intrinsicality. (a) Activation functions without bias (η=0) and different levels of constraint (τ=0, τ=1 and τ=10). (b) System S analyzed in this figure. The remaining panels show on top the causal graph of the mechanism M={A} at state m={1} constraining different output purviews and on the bottom the probability distributions of the purviews (effect repertoires). The black bars show the probabilities when the mechanism is constraining the purview, and the white bars show the unconstrained probabilities after the complete partition ψ⁰. The “*” indicates the state selected by the maximum operation in the intrinsic difference (ID) function. (c) The mechanism fully constrains the unit B in the purview Z={B} (τB=0), resulting in state z={↑} defining the amount of intrinsic information in the mechanism as φ(m,Z,ψ⁰)=ID(πe(B|M=↑)∣πe^ψ⁰(B|M=↑))=πe(B=↑|A=↑)·|log(πe(B=↑|A=↑)/πe^ψ⁰(B=↑|M=↑))|=1·0.69=0.69. (d) After adding a slightly undetermined unit (τC=1) to the purview (Z={B,C}), the intrinsic information increases to 1.11. The new maximum state (z={↑,↑}) has now much higher informativeness (|log(πe(BC=↑↑|A=↑)/πe^ψ⁰(BC=↑↑|A=↑))|=1.26) but only slightly lower selectivity (π(BC=↑↑|A=↑)=0.89), resulting in expansion. (e) When instead of C, we add the very undetermined unit D to the purview (τD=10), the new purview (Z={B,D}) has a new maximum state (z={↑,↑}) with marginally higher informativeness (|log(πe(BC=↑↑|A=↑)/πe^ψ⁰(BC=↑↑|A=↑))|=0.79) and very low selectivity (πe(BC=↑↑|A=↑)=0.55), resulting in dilution.
Figure 2 Intrinsicality. (a) Activation functions without bias (η=0) and different levels of constraint (τ=0, τ=1 and τ=10). (b) System S analyzed in this figure. The remaining panels show on top the causal graph of the mechanism M={A} at state m={1} constraining different output purviews and on the bottom the probability distributions of the purviews (effect repertoires). The black bars show the probabilities when the mechanism is constraining the purview, and the white bars show the unconstrained probabilities after the complete partition ψ⁰. The “*” indicates the state selected by the maximum operation in the intrinsic difference (ID) function. (c) The mechanism fully constrains the unit B in the purview Z={B} (τB=0), resulting in state z={↑} defining the amount of intrinsic information in the mechanism as φ(m,Z,ψ⁰)=ID(πe(B|M=↑)∣πe^ψ⁰(B|M=↑))=πe(B=↑|A=↑)·|log(πe(B=↑|A=↑)/πe^ψ⁰(B=↑|M=↑))|=1·0.69=0.69. (d) After adding a slightly undetermined unit (τC=1) to the purview (Z={B,C}), the intrinsic information increases to 1.11. The new maximum state (z={↑,↑}) has now much higher informativeness (|log(πe(BC=↑↑|A=↑)/πe^ψ⁰(BC=↑↑|A=↑))|=1.26) but only slightly lower selectivity (π(BC=↑↑|A=↑)=0.89), resulting in expansion. (e) When instead of C, we add the very undetermined unit D to the purview (τD=10), the new purview (Z={B,D}) has a new maximum state (z={↑,↑}) with marginally higher informativeness (|log(πe(BC=↑↑|A=↑)/πe^ψ⁰(BC=↑↑|A=↑))|=0.79) and very low selectivity (πe(BC=↑↑|A=↑)=0.55), resulting in dilution.CC BY · PubMed Central
Figure 3 Information. (a) System S analyzed in this figure. All units have τ=1 and η=−3 (partially deterministic AND gates). The remaining panels show on the left the time unfolded graph of the mechanism M={A,B,C,D} constraining different output purviews and on the right the probability distribution of the purview Z={A,B,C} (effect repertoires). The black bars show the probabilities when the mechanism is constraining the purview, and the white bars show the unconstrained probabilities after the complete partition. The “*” indicates the state selected by the maximum operation in the ID function. (b) The mechanism at state m={↓,↓,↓,↓}. The purview state z={↓,↓,↓} is not only the most constrained by the mechanism (high informativeness) but also very dense (high selectivity). As a result, it has intrinsic information higher than all other states in the purview and defines the intrinsic information of the mechanism as 0.27. (c) If we change the mechanism state to m={↓,↑,↑,↑}, the probability of observing the purview state z={↓,↓,↓} is now smaller than chance. However, this probability is still very different from chance and therefore very constrained by the mechanism (high informativeness). At the same time, the state is still very dense, meaning it has a probability of happening much higher than all other states (high selectivity). Together, they define the intrinsic information of the state, which is higher than the intrinsic information of all other states in the purview, defining the intrinsic information of the mechanism as 0.08.
Figure 3 Information. (a) System S analyzed in this figure. All units have τ=1 and η=−3 (partially deterministic AND gates). The remaining panels show on the left the time unfolded graph of the mechanism M={A,B,C,D} constraining different output purviews and on the right the probability distribution of the purview Z={A,B,C} (effect repertoires). The black bars show the probabilities when the mechanism is constraining the purview, and the white bars show the unconstrained probabilities after the complete partition. The “*” indicates the state selected by the maximum operation in the ID function. (b) The mechanism at state m={↓,↓,↓,↓}. The purview state z={↓,↓,↓} is not only the most constrained by the mechanism (high informativeness) but also very dense (high selectivity). As a result, it has intrinsic information higher than all other states in the purview and defines the intrinsic information of the mechanism as 0.27. (c) If we change the mechanism state to m={↓,↑,↑,↑}, the probability of observing the purview state z={↓,↓,↓} is now smaller than chance. However, this probability is still very different from chance and therefore very constrained by the mechanism (high informativeness). At the same time, the state is still very dense, meaning it has a probability of happening much higher than all other states (high selectivity). Together, they define the intrinsic information of the state, which is higher than the intrinsic information of all other states in the purview, defining the intrinsic information of the mechanism as 0.08.CC BY · PubMed Central
Figure 4 Integration. (a) System S analysed in this figure and in Figure 5. All units have τ=1 and η=0 (partially deterministic MAJORITY gates). The remaining panels show on the top the time unfolded graph of different mechanisms constraining different output purviews and on the bottom the probability distributions (effect repertoires). The black bars show the probabilities when the mechanism is constraining the purview, and the white bars show the partitioned probabilities. The “*” indicates the state selected by the maximum operation in the ID function. (b) The mechanism M={A,E} in state m={↑,↓} constraining the purview Z={A,E}. While the complete partition has nonzero intrinsic information, the mechanism is clearly not integrated, as revealed by the MIP partition ψ^(*)={({A,},{A}),({E,},{E})}, resulting in zero integrated information. (c) The mechanism M={A,B} in state m={↑,↑} constraining the purview Z={A,B}. The partition ψ^(*)={({A,},{A,B}),({B},{∅})} has less intrinsic information than any other partition, i.e., it is the MIP of this mechanism, and it defines the integrated information as 0.36. (d) The mechanism M={A,B,D} in state m={↑,↑,↓} constraining the purview Z={E,F}. The tri-partition ψ^(*)={({A},{∅}),({∅,},{F}),({B,D},{E})} is the MIP and it shows that the mechanism is not integrated, i.e, the mechanism has zero integrated information.
Figure 4 Integration. (a) System S analysed in this figure and in Figure 5. All units have τ=1 and η=0 (partially deterministic MAJORITY gates). The remaining panels show on the top the time unfolded graph of different mechanisms constraining different output purviews and on the bottom the probability distributions (effect repertoires). The black bars show the probabilities when the mechanism is constraining the purview, and the white bars show the partitioned probabilities. The “*” indicates the state selected by the maximum operation in the ID function. (b) The mechanism M={A,E} in state m={↑,↓} constraining the purview Z={A,E}. While the complete partition has nonzero intrinsic information, the mechanism is clearly not integrated, as revealed by the MIP partition ψ^(*)={({A,},{A}),({E,},{E})}, resulting in zero integrated information. (c) The mechanism M={A,B} in state m={↑,↑} constraining the purview Z={A,B}. The partition ψ^(*)={({A,},{A,B}),({B},{∅})} has less intrinsic information than any other partition, i.e., it is the MIP of this mechanism, and it defines the integrated information as 0.36. (d) The mechanism M={A,B,D} in state m={↑,↑,↓} constraining the purview Z={E,F}. The tri-partition ψ^(*)={({A},{∅}),({∅,},{F}),({B,D},{E})} is the MIP and it shows that the mechanism is not integrated, i.e, the mechanism has zero integrated information.CC BY · PubMed Central
Figure 5 Exclusion. Causal graphs of different mechanisms constraining different purviews. The system S used in these examples is the same as in Figure 4a. Each line shows the mechanism M constraining different purviews Z. (a) The mechanism M={A} at state m={↑}. The bottom line shows the purview Z∈S with maximum integrated effect information and the MIP is the complete partition. (b) The mechanism M={A,B,C,D} at state m={↑,↑,↑,↓}. The bottom line is the purview Z∈S with maximum integrated effect information and the MIP is ψ^(*)={({A,B,C},{A,B,C}),({D},{∅})}.
Figure 5 Exclusion. Causal graphs of different mechanisms constraining different purviews. The system S used in these examples is the same as in Figure 4a. Each line shows the mechanism M constraining different purviews Z. (a) The mechanism M={A} at state m={↑}. The bottom line shows the purview Z∈S with maximum integrated effect information and the MIP is the complete partition. (b) The mechanism M={A,B,C,D} at state m={↑,↑,↑,↓}. The bottom line is the purview Z∈S with maximum integrated effect information and the MIP is ψ^(*)={({A,B,C},{A,B,C}),({D},{∅})}.CC BY · PubMed Central
Figure 6 Integrated cause information. (a) Causal graph of mechanism M={A,B,C,D} at state m={↑,↑,↑,↓} constraining the purview Z={A,B,F}, which has the maximum integrated information of all Z⊆S and defines the mechanism integrated information. (b) The black bars show the probabilities when the mechanism is constraining the purview (cause repertoire), and the white bars show the probabilities after the partition (partitioned cause repertoire). The “*” indicates the state selected by the maximum operation in the ID function and defines Zc^(*).
Figure 6 Integrated cause information. (a) Causal graph of mechanism M={A,B,C,D} at state m={↑,↑,↑,↓} constraining the purview Z={A,B,F}, which has the maximum integrated information of all Z⊆S and defines the mechanism integrated information. (b) The black bars show the probabilities when the mechanism is constraining the purview (cause repertoire), and the white bars show the probabilities after the partition (partitioned cause repertoire). The “*” indicates the state selected by the maximum operation in the ID function and defines Zc^(*).CC BY · PubMed Central

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 76

Metadata

Authors
Barbosa, L. S., Marshall, W., Albantakis, L., & Tononi, G.
Affiliations
University of Wisconsin–Madison (US)
Corresponding author
Tononi, Giulio
Venue
Entropy
Publisher
MDPI AG
Published
2021-03-18
Volume
23
Issue
3
Pages
362
ISSN
1099-4300 (ISSN-L)
OpenAlex
W3137983215
Cited by
72
References
21
Citations by year
2026: 9 · 2025: 22 · 2024: 15 · 2023: 13 · 2022: 8 · 2021: 4
FWCI
9.66
Type
journal article
Language
en
Open access
Locations
  • Entropy (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • Tiny Blue Dot Foundation (UW 133AAG3451)
  • Templeton World Charity Foundation (TWCF0216)
Topics
  • Social Sciences › Arts and Humanities › Philosophy › Philosophy and Theoretical Science
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Systems and Dynamics
  • Social Sciences › Arts and Humanities › History and Philosophy of Science › Philosophy of Biology and Scientific Explanation
Keywords
integrated information theory, consciousness, information measures, subjective experience

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.