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

Phenomenal vs Access Consciousness

College Depth 97 in the knowledge graph ☐ I know this ☆ Set as goal
16topics build on this
626prerequisites beneath it
See this on the map →
Qualia and Phenomenal ConsciousnessThe Hard Problem of Consciousness→→Access Consciousness: Information AvailabilityAffective Consciousness and Emotional Experience+10 more
Block phenomenal-consciousness access-consciousness overflow

Core Idea

Ned Block distinguishes two concepts that the word 'consciousness' conflates. Phenomenal consciousness (P-consciousness) is the subjective, experiential quality of a mental state — what it is like to see red or feel pain. Access consciousness (A-consciousness) is the availability of a mental state's content for use in reasoning, report, and the rational control of behavior. Block argues these come apart: a state can be phenomenally conscious without being accessed (as suggested by partial-report experiments and Sperling's iconic memory paradigm), and a state can be access-conscious without having any distinctive phenomenal character. The 'overflow' argument holds that phenomenal experience is richer than what the cognitive access bottleneck can capture at any moment.

How It's Best Learned

Start with Block's 'On a Confusion about a Function of Consciousness' (1995). Then examine the Sperling partial-report experiments and the debate between Block and cognitive-access theorists like Cohen and Dennett over whether overflow is real or an illusion of retrospective report.

Common Misconceptions

Explainer

From your study of qualia and the hard problem, you already know that there is something philosophically puzzling about subjective experience — about the fact that there is "something it is like" to see red or feel pain. Ned Block's distinction between phenomenal and access consciousness is an attempt to bring precision to this puzzle by separating two things the word "consciousness" has been conflating.

Phenomenal consciousness (P-consciousness) is the qualitative, subjective character of experience — the redness of red, the sharpness of a headache, the felt warmth of sun on your skin. This is the dimension that makes the hard problem hard: why does any physical process give rise to this qualitative character at all? Access consciousness (A-consciousness), by contrast, is a functional property: a mental state is A-conscious when its content is broadcast to and available for use by the cognitive systems governing reasoning, report, and the control of action. A-consciousness is, in principle, the sort of thing a cognitive science of information flow could fully describe without invoking any subjective qualities.

Block's crucial claim is that these two properties can come apart. His main empirical case draws on Sperling's classic iconic memory experiments. A subject briefly sees a 3×4 grid of letters. After it disappears, they can accurately report any row — but only one; the rest fades before it can be reported. Block argues that subjects phenomenally experienced the full grid (the full array was present in experience), but only one row at a time was *accessible* for report. Phenomenal experience "overflowed" cognitive access. Critics like Dennett and Cohen dispute this — they argue that what looks like overflow is a retrospective illusion, that subjects never really experienced the full array phenomenally. This debate remains live.

Why does the distinction matter? If Block is right, then theories that define consciousness entirely in functional terms — as availability for report and reasoning — will systematically miss the phenomenal dimension. A philosophical zombie (from your earlier study of qualia) would have full A-consciousness but no P-consciousness. A patient with certain neurological conditions might have P-consciousness without the cognitive access needed to report it. These possibilities only make sense if you hold the two concepts apart. Block's contribution is to give philosophers and cognitive scientists a cleaner vocabulary for what had been a confusing cluster of questions.

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

Longest path: 98 steps · 626 total prerequisite topics

Prerequisites (2)

Leads To (12)