Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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

Formalizing falsification for theories of consciousness across computational hierarchies

Open access
Hanson, Jake R, Walker, Sara I · 2021 · Neuroscience of Consciousness

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.

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

Integrity signals

Registry

Crossref · 10.1093/nc/niab014

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1. The computational hierarchy used to classify formal levels of description. At the top of the hierarchy is the abstract FSA description of a computation which, in this case, is a mod-eight counter. Beneath this level is the CSA description in which abstract states of the FSA have been assigned specific binary labels which, in turn, constrain local dependencies between subcomponents. Note, it is this level of the hierarchy that IIT uses to calculate Φ. At the bottom of the hierarchy is the full causal structure, as specified in terms of the specific logic gates that implement the Boolean functions from the CSA level. In this case, we have shown two different choices for a complete logical basis: AND/OR/NOT gates or universal NAND gates.
Figure 1. The computational hierarchy used to classify formal levels of description. At the top of the hierarchy is the abstract FSA description of a computation which, in this case, is a mod-eight counter. Beneath this level is the CSA description in which abstract states of the FSA have been assigned specific binary labels which, in turn, constrain local dependencies between subcomponents. Note, it is this level of the hierarchy that IIT uses to calculate Φ. At the bottom of the hierarchy is the full causal structure, as specified in terms of the specific logic gates that implement the Boolean functions from the CSA level. In this case, we have shown two different choices for a complete logical basis: AND/OR/NOT gates or universal NAND gates.CC BY-NC · PubMed Central
Figure 2. Schematic illustration of a simplified electronic tollbooth (a) and its FSA description (b). The general behavior of the tollbooth is to lift a boom barrier upon receipt of eight quarters ($2.00). To do this requires the ability to cycle through eight internal memory states {A,B,…,H}, sending each internal state as output to the boom barrier.
Figure 2. Schematic illustration of a simplified electronic tollbooth (a) and its FSA description (b). The general behavior of the tollbooth is to lift a boom barrier upon receipt of eight quarters ($2.00). To do this requires the ability to cycle through eight internal memory states {A,B,…,H}, sending each internal state as output to the boom barrier.CC BY-NC · PubMed Central
Figure 3. A JK flip-flop is a widely used binary memory device (bit) in digital electronics (a). The internal state of the flip-flop takes one of two values (Q∈{0,1}) and is continuously sent as output. Upon receipt of a voltage from a clocked input, the voltages on the two input channels J and K dictate the state transitions of Q (see main). For any desired internal state transition Q(t0)→Q(t1), there are two JK inputs that will correctly realize the transition (b) which provides flexibility when it comes to circuit design.
Figure 3. A JK flip-flop is a widely used binary memory device (bit) in digital electronics (a). The internal state of the flip-flop takes one of two values (Q∈{0,1}) and is continuously sent as output. Upon receipt of a voltage from a clocked input, the voltages on the two input channels J and K dictate the state transitions of Q (see main). For any desired internal state transition Q(t0)→Q(t1), there are two JK inputs that will correctly realize the transition (b) which provides flexibility when it comes to circuit design.CC BY-NC · PubMed Central
Figure 4. To construct the digital circuit for the conscious tollbooth, we convert the global state transitions into their associated JK values (a). Then, we use Karnaugh maps to determine the elementary logic required to update each component (b). The presence of feedback in the resultant digital circuit is evident by the dependence of earlier components on later components (e.g. J1=Q1Q2¯+Q3¯) and vice versa (e.g. K3=Q1Q2¯).
Figure 4. To construct the digital circuit for the conscious tollbooth, we convert the global state transitions into their associated JK values (a). Then, we use Karnaugh maps to determine the elementary logic required to update each component (b). The presence of feedback in the resultant digital circuit is evident by the dependence of earlier components on later components (e.g. J1=Q1Q2¯+Q3¯) and vice versa (e.g. K3=Q1Q2¯).CC BY-NC · PubMed Central
Figure 5. An integrated digital circuit (a) designed to operate the electronic tollbooth was shown in Fig. 2. As can be seen, the causal structure contains meaningful feedback in the form of bidirectional dependencies between pairs of elements and, consequently, has Φ>0 for all states (b).
Figure 5. An integrated digital circuit (a) designed to operate the electronic tollbooth was shown in Fig. 2. As can be seen, the causal structure contains meaningful feedback in the form of bidirectional dependencies between pairs of elements and, consequently, has Φ>0 for all states (b).CC BY-NC · PubMed Central
Figure 6. The state transitions and JK values (a) corresponding to the hierarchical labeling scheme described in the main text. Panel (b) shows the Karnaugh maps used to determine the elementary logic gates used in the construction of the feed-forward logical architecture. Note, the logical dependence between components is strictly unidirectional (e.g. J2 and K2 depend only on the state of Q1).
Figure 6. The state transitions and JK values (a) corresponding to the hierarchical labeling scheme described in the main text. Panel (b) shows the Karnaugh maps used to determine the elementary logic gates used in the construction of the feed-forward logical architecture. Note, the logical dependence between components is strictly unidirectional (e.g. J2 and K2 depend only on the state of Q1).CC BY-NC · PubMed Central
Figure 7. A feed-forward digital circuit (a) designed to operate the electronic tollbooth was shown in Fig. 2. This causal structure operates under the same memory constraints as the integrated circuit (i.e. a three-bit logical architecture) but has Φ = 0 for all states (b).
Figure 7. A feed-forward digital circuit (a) designed to operate the electronic tollbooth was shown in Fig. 2. This causal structure operates under the same memory constraints as the integrated circuit (i.e. a three-bit logical architecture) but has Φ = 0 for all states (b).CC BY-NC · 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

Show all 28 references

Research works printed but not linked: 4

  1. Godfrey-Smith, 2009, Theory and Reality: An Introduction to the Philosophy of Science
  2. Rescorla, 2020, The Stanford Encyclopedia of Philosophy (Metaphysics Research Lab, Stanford University)
  3. Wolpert, Thermodynamics of Computing with Circuits, 22
  4. Zeiger, 1968, Algebraic Theory of Machines, Languages, and Semigroups, chap, 55

Cited by

See all 17

Metadata

Authors
Hanson, J. R., & Walker, S. I.
Affiliations
  • Arizona State University (US)
  • Santa Fe Institute (US)
Corresponding author
Walker, Sara I
Venue
Neuroscience of Consciousness
Published
2021-05-01
Volume
2021
Issue
2
Pages
niab014-niab014
ISSN
2057-2107 (ISSN-L)
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
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Formalizing falsification for theories of consciousness across computational hierarchies. https://app.cochat.ai/papers/10.1093/nc/niab014
The paper
Hanson, J. R., & Walker, S. I. (2021). Formalizing falsification for theories of consciousness across computational hierarchies. Neuroscience of Consciousness. https://doi.org/10.1093/nc/niab014

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.