A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Access Consciousness: Information Availability

College Depth 101 in the knowledge graph ☐ I know this ☆ Set as goal
4topics build on this
643prerequisites beneath it
See this on the map →
Defining ConsciousnessPhenomenal vs Access Consciousness+2 more→→Integrated Information Theory of ConsciousnessTransparency and Privileged Access to Consciousness
access consciousness information

Core Idea

Access consciousness involves information being globally available for reasoning, report, and behavioral control. A mental state is access-conscious if its content can be used by reasoning and behavior-producing systems, distinct from phenomenal consciousness which concerns subjective feel.

Explainer

You already know that consciousness in general raises the question of whether there is something it is like to be in a mental state — the puzzle of subjective experience. And if you've encountered the phenomenal/access distinction, you know that Ned Block drew a line between two different things philosophers might mean by "conscious." Access consciousness is one side of that line, and it has a precise, functional definition: a mental state is access-conscious if its content is globally available — broadcast widely enough in the cognitive system to be used by reasoning, verbal report, and the voluntary guidance of behavior.

Think of the mind as having many specialized processors running in parallel: perceptual systems, memory, motor planning, language production, and executive reasoning. Most of what these systems compute never becomes available to the whole system — peripheral processing remains local and isolated. A mental state achieves access consciousness when it enters a global workspace: a broadcast mechanism that makes its content available across multiple processors simultaneously. You can talk about it, reason with it, use it to guide voluntary action. The Global Workspace Theory of consciousness, associated with Bernard Baars, is essentially an account of access consciousness — it proposes that the brain has an architecture in which certain representations are globally broadcast while others remain local and inaccessible.

What makes this definition philosophically significant is the contrast with phenomenal consciousness — the felt quality of experience, the redness of red, the ache of pain. A mental state can in principle have phenomenal character without being access-conscious, and perhaps vice versa. The case of blindsight is the most discussed empirical support for this dissociation: patients with damage to primary visual cortex deny seeing anything in part of their visual field (no phenomenal experience), yet can correctly guess properties of stimuli presented there above chance (information is somehow accessible). Their performance suggests that some form of information processing occurs without phenomenal awareness, though how cleanly this maps onto access consciousness is debated.

The distinction matters most for the hard problem. The hard problem asks why physical processes give rise to subjective experience — why there is *something it is like* to be in a particular state. This question targets phenomenal consciousness. Access consciousness, by contrast, is relatively tractable: we have plausible functional and neural accounts of how information gets globally broadcast and becomes available for reasoning and report. When someone asks whether a robot or AI system is conscious, the philosophically interesting question is almost always about phenomenal consciousness — whether there is something it is like to be the system — not about access consciousness, which any sufficiently sophisticated information-processing system might achieve. Keeping these concepts clearly separated is essential for making precise claims about minds, machines, and the gaps in our understanding of either.

What did you take from this?

Topics in reflective domains aren't scored by quiz answers. Read, reflect, and mark when you've thought it through.

Quiz me anyway →

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Boolean Type and Truth Values → Comparison Operators and Boolean Tests → Logical Operators and Boolean Algebra → Boolean Algebra and Fundamental Laws → Logic Gates Fundamentals → Implementing Boolean Functions with Gates → Karnaugh Map Simplification → Combinational Circuit Design → Flip-Flops and Latches → Finite State Machines (FSMs) → Deterministic Finite Automata (DFA) → Nondeterministic Finite Automata (NFA) → Two-Way Finite Automata → NFA to DFA Conversion (Subset Construction) → DFA Properties and Minimization Algorithms → Regular Languages: Definition and Characterization → Context-Free Grammars (CFGs) → Pushdown Automata (PDA) → Equivalence of CFGs and Pushdown Automata → Closure Properties of Context-Free Languages → Limitations of Context-Free Languages → Pumping Lemma for Context-Free Languages → Turing Machines → Variants of Turing Machines and Equivalence → Universal Turing Machine and Self-Simulation → Church-Turing Thesis and Computability → Functionalism → The Hard Problem of Consciousness → Phenomenal vs Access Consciousness → Higher-Order Theories of Consciousness → Self-Consciousness and Self-Awareness → Reflexivity and Self-Awareness in Conscious Experience → Access Consciousness: Information Availability

Longest path: 102 steps · 643 total prerequisite topics

Prerequisites (4)

Leads To (2)