Formalizing falsification for theories of consciousness across computational hierarchies
Open accessThe DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Abstract
The scientific study of consciousness is currently undergoing a critical transition in the form of a rapidly evolving scientific debate regarding whether or not currently proposed theories can be assessed for their scientific validity. At the forefront of this debate is Integrated Information Theory (IIT), widely regarded as the preeminent theory of consciousness because it quantified subjective experience in a scalar mathematical measure called Φ that is in principle measurable. Epistemological issues in the form of the “unfolding argument” have provided a concrete refutation of IIT by demonstrating how it permits functionally identical systems to have differences in their predicted consciousness. The implication is that IIT and any other proposed theory based on a physical system’s causal structure may already be falsified even in the absence of experimental refutation. However, so far many of these arguments surrounding the epistemological foundations of falsification arguments, such as the unfolding argument, are too abstract to determine the full scope of their implications. Here, we make these abstract arguments concrete, by providing a simple example of functionally equivalent machines realizable with table-top electronics that take the form of isomorphic digital circuits with and without feedback. This allows us to explicitly demonstrate the different levels of abstraction at which a theory of consciousness can be assessed. Within this computational hierarchy, we show how IIT is simultaneously falsified at the finite-state automaton level and unfalsifiable at the combinatorial-state automaton level. We use this example to illustrate a more general set of falsification criteria for theories of consciousness: to avoid being already falsified, or conversely unfalsifiable, scientific theories of consciousness must be invariant with respect to changes that leave the inference procedure fixed at a particular level in a computational hierarchy.
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.
Integrity signals
Registry
Cites
Statistics
Figures







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.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This is because the internal binary update sequence depends on the interactions among the internal units [29, 53], which differ in the three cases, as can easily be determined through manipulations and observations.”
From Integrated information theory (IIT) 4.0: Formulating the properties of phenomenal existence in physical terms (2023) · cites this paper as [53]
Experimental — accuracy not yet measured
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
I.—COMPUTING MACHINERY AND INTELLIGENCE
TURING, A. M. (1950) · Mind · doi:10.1093/mind/lix.236.433 · Cited by 10,290
Nagel, T. (1974) · The Philosophical Review · doi:10.2307/2183914 · Cited by 7,440
The thermodynamics of computation—a review
Bennett, C. H. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02084158 · Cited by 2,006 · cited 1×
“However, it is important to note that biological systems typically operate many orders of magnitude above this theoretical limit on thermodynamic efficiency due to the macroscopic size of the components implementing the computation (Bennett 1982).”
Tononi, G. (1998) · Science · doi:10.1126/science.282.5395.1846 · Cited by 1,561 · cited 1×
“Group Complexity is a measure of complexity that is both nontrivial and falsifiable, and therefore, it is an epistemologically sound measure of consciousness that acts on the same mathematical structures and retains some of the original insight that motivated IIT(Tononi and Edelman 1998).”
A theoretically based index of consciousness independent of sensory processing and behavior
Casali, A. G., Gosseries, O., Rosanova, M., Boly, M., Sarasso, S., Casali, K. R., Casarotto, S., Bruno, M.-A., Laureys, S., Tononi, G., et al. (2013) · Science Translational Medicine · doi:10.1126/scitranslmed.3006294 · Cited by 1,246 · cited 2×
“In this case, the inference procedure being used is based on abstract input–output behavior (i.e. the FSA level) where functional states such as sleep are expected in response to inputs such as anesthetics (Casali et al .”
From the phenomenology to the mechanisms of consciousness: integrated information theory 3.0
Oizumi, M., Albantakis, L., & Tononi, G. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003588 · Cited by 1,128
Neural correlates of consciousness in humans
Rees, G., Kreiman, G., & Koch, C. (2002) · Nature Reviews Neuroscience · doi:10.1038/nrn783 · Cited by 742
The map method for synthesis of combinational logic circuits
Karnaugh, M. (1953) · Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics · doi:10.1109/tce.1953.6371932 · Cited by 624
Integrated information in discrete dynamical systems: motivation and theoretical framework
Balduzzi, D., & Tononi, G. (2008) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000091 · Cited by 419 · cited 1×
“To calculate U , the states of the system must be specified as binary strings (Balduzzi and Tononi 2008; Oizumi et al. 2014), which implies the internal representations of functional states must be fixed.”
Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
Krohn, K., & Rhodes, J. (1965) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1965-0188316-1 · Cited by 327
Conjectures and Refutations: The Growth of Scientific Knowledge
Popper, K. (2014) · doi:10.4324/9780203538074 · Cited by 327
A Computational Foundation for the Study of Cognition
Chalmers, D. J. (2011) · Journal of Cognitive Science · doi:10.17791/jcs.2011.12.4.325 · Cited by 294
Neural Correlates of Consciousness: Empirical and Conceptual Questions
(2000) · The MIT Press eBooks · doi:10.7551/mitpress/4928.001.0001 · Cited by 271
Other bodies, other minds: A machine incarnation of an old philosophical problem
Harnad, S. (1991) · Minds and Machines · doi:10.1007/bf00360578 · Cited by 231
Hard criteria for empirical theories of consciousness
Doerig, A., Schurger, A., & Herzog, M. H. (2021) · Cognitive Neuroscience · doi:10.1080/17588928.2020.1772214 · Cited by 194
Can the macro beat the micro? Integrated information across spatiotemporal scales
Hoel, E. P., Albantakis, L., Marshall, W., & Tononi, G. (2016) · Neuroscience of Consciousness · doi:10.1093/nc/niw012 · Cited by 140
The unfolding argument: Why IIT and other causal structure theories cannot explain consciousness
Doerig, A., Schurger, A., Hess, K., & Herzog, M. H. (2019) · Consciousness and Cognition · doi:10.1016/j.concog.2019.04.002 · Cited by 140
PyPhi: A toolbox for integrated information theory
Mayner, W. G. P., Marshall, W., Albantakis, L., Findlay, G., Marchman, R., & Tononi, G. (2018) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1006343 · Cited by 118
When the Map Is Better Than the Territory
Hoel, E. (2017) · Entropy · doi:10.3390/e19050188 · Cited by 97
Black-boxing and cause-effect power
Marshall, W., Albantakis, L., & Tononi, G. (2018) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1006114 · Cited by 73
Falsification and consciousness
Kleiner, J., & Hoel, E. (2021) · Neuroscience of Consciousness · doi:10.1093/nc/niab001 · Cited by 46
Walker, S. I., & Davies, P. C. W. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316584200.002 · Cited by 43
Self-citationCausal composition: Structural differences among dynamically equivalent systems
Albantakis, L., & Tononi, G. (2019) · Entropy · doi:10.3390/e21100989 · Cited by 30
Negro, N. (2020) · Phenomenology and the Cognitive Sciences · doi:10.1007/s11097-020-09681-3 · Cited by 25
Rival theories face off over brain’s source of consciousness
Reardon, S. (2019) · Science · doi:10.1126/science.366.6463.293 · Cited by 23
Egri-Nagy, A., & Nehaniv, C. L. (2008) · Artificial Life · doi:10.1162/artl.2008.14.3.14305 · Cited by 22
Yet another proof of the cascade decomposition theorem for finite automata
Zeiger, P. (1967) · Theory of Computing Systems · doi:10.1007/bf01703821 · Cited by 16
Computational Holonomy Decomposition of Transformation SemigroupsPreprint
Egri-Nagy, A., & Nehaniv, C. L. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1508.06345 · Cited by 13
Effective theories for circuits and automata
DeDeo, S. (2011) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.3640747 · Cited by 11
Integrated Information Theory and Isomorphic Feed-Forward Philosophical Zombies
Hanson, J. R., & Walker, S. I. (2019) · Entropy · doi:10.3390/e21111073 · Cited by 8
Self-citationMoore, E. F. (1958) · Journal of Symbolic Logic · doi:10.2307/2964323 · Cited by 1
Research works printed but not linked: 4
- Godfrey-Smith, 2009, Theory and Reality: An Introduction to the Philosophy of Science
- Rescorla, 2020, The Stanford Encyclopedia of Philosophy (Metaphysics Research Lab, Stanford University)
- Wolpert, Thermodynamics of Computing with Circuits, 22
- Zeiger, 1968, Algebraic Theory of Machines, Languages, and Semigroups, chap, 55
Cited by
Albantakis, L., Barbosa, L., Findlay, G., Grasso, M., Haun, A. M., Marshall, W., Mayner, W. G. P., Zaeemzadeh, A., Boly, M., Juel, B. E., et al. (2023) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1011465 · Cited by 292
“The function could be thought of, for example, as an electronic tollbooth “counting 8 valid coins” (8 times input I = 1) before opening the gate [64].”
The Integrated Information Theory of Consciousness as Pseudoscience
IIT-Concerned, Fleming, S. M., Frith, C. D., Goodale, M., Lau, H., LeDoux, J. E., Lee, A. L. F., Michel, M., Owen, A. M., Peters, M. A. K., et al. (2023) · doi:10.31234/osf.io/zsr78 · Cited by 81
Falsification and consciousness
Kleiner, J., & Hoel, E. (2021) · Neuroscience of Consciousness · doi:10.1093/nc/niab001 · Cited by 46
Metzinger, T. K. (2024) · The MIT Press eBooks · doi:10.7551/mitpress/15196.001.0001 · Cited by 101
Falsification and consciousness
Kleiner, J., & Hoel, E. (2020) · arXiv · doi:10.48550/arxiv.2004.03541 · Cited by 46
Metadata
- Authors
- Hanson, J. R., & Walker, S. I.
- Affiliations
- Arizona State University (US)
- Santa Fe Institute (US)
- Corresponding author
- Walker, Sara I
- ORCID
- Walker, Sara I
- Venue
- Neuroscience of Consciousness
- Publisher
- Oxford University Press (OUP)
- Published
- 2021-05-01
- Volume
- 2021
- Issue
- 2
- Pages
- niab014-niab014
- ISSN
- 2057-2107 (ISSN-L)
- PMC
- PMC8339439
- OpenAlex
- W3083297807
- Cited by
- 16
- References
- 28
- Citations by year
- 2026: 3 · 2025: 1 · 2024: 2 · 2023: 5 · 2022: 4 · 2021: 1
- FWCI
- 2.90
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Neuroscience of Consciousness (publishedVersion, cc-by-nc)
- PubMed Central (publishedVersion, cc-by-nc)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- John Templeton Foundation and the Foundational Questions
- Topics
- Social Sciences › Arts and Humanities › Philosophy › Philosophy and Theoretical Science
- Social Sciences › Arts and Humanities › History and Philosophy of Science › Philosophy of Biology and Scientific Explanation
- Life Sciences › Neuroscience › Cognitive Neuroscience › Embodied and Extended Cognition
- Keywords
- integrated information theory, theory of consciousness, falsification, computational hierarchy, finite automata, digital circuits, feedback, levels of abstraction, epistemology of science, unfalsifiability
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.