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 moreIntegrated 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraBoolean Type and Truth ValuesComparison Operators and Boolean TestsLogical Operators and Boolean AlgebraBoolean Algebra and Fundamental LawsLogic Gates FundamentalsImplementing Boolean Functions with GatesKarnaugh Map SimplificationCombinational Circuit DesignFlip-Flops and LatchesFinite State Machines (FSMs)Deterministic Finite Automata (DFA)Nondeterministic Finite Automata (NFA)Two-Way Finite AutomataNFA to DFA Conversion (Subset Construction)DFA Properties and Minimization AlgorithmsRegular Languages: Definition and CharacterizationContext-Free Grammars (CFGs)Pushdown Automata (PDA)Equivalence of CFGs and Pushdown AutomataClosure Properties of Context-Free LanguagesLimitations of Context-Free LanguagesPumping Lemma for Context-Free LanguagesTuring MachinesVariants of Turing Machines and EquivalenceUniversal Turing Machine and Self-SimulationChurch-Turing Thesis and ComputabilityFunctionalismThe Hard Problem of ConsciousnessPhenomenal vs Access ConsciousnessHigher-Order Theories of ConsciousnessSelf-Consciousness and Self-AwarenessReflexivity and Self-Awareness in Conscious ExperienceAccess Consciousness: Information Availability

Longest path: 102 steps · 643 total prerequisite topics

Prerequisites (4)

Leads To (2)