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

Computational Theory of Mind

College Depth 97 in the knowledge graph ☐ I know this ☆ Set as goal
5topics build on this
639prerequisites beneath it
See this on the map →
FunctionalismMultiple Realizability+4 more→→Artificial Intelligence and Machine ConsciousnessSubstrate Independence+1 more
computationalism information syntax functionalism AI

Core Idea

The computational theory holds that the mind is fundamentally a computational system—that mental processes are information-processing operations describable in purely formal, syntactic terms. This provides a bridge between abstract mental operations and their physical implementation.

How It's Best Learned

Study Turing machines and their relation to mental processes. Examine the Chinese Room argument as a challenge to pure computationalism. Consider how syntax and semantics interact.

Common Misconceptions

Explainer

The computational theory of mind (CTM) takes the functionalism you already know and gives it a precise formal backbone. If functionalism says mental states are defined by their causal-functional roles, CTM says those roles are best understood as computational operations: symbol manipulation governed by formal rules. Your mind, on this view, does not just happen to be implemented in neurons — it is running a program, and the program is what constitutes thought. The brain is hardware; cognition is software.

To build intuition here, think about what a Turing machine does. It reads symbols, applies rules, writes new symbols, and moves to a new state — all without knowing what the symbols *mean*. CTM proposes that mental processes have exactly this structure: they are syntactic transformations operating over mental representations. A belief that "it is raining" is not a raw feeling but an internal symbol with a certain content, and reasoning is the manipulation of such symbols according to rules. This is why your prerequisite on representationalism matters: CTM needs mental representations as the objects over which computation operates.

The theory's deepest power lies in what it explains about generativity. The reason humans can entertain infinitely many distinct thoughts — combining concepts in novel ways — is the same reason a simple Turing machine can compute infinitely many functions: a finite set of rules applied recursively to symbols generates unbounded complexity. CTM explains the systematicity and productivity of thought: if you can think "John loves Mary," you can think "Mary loves John," because your cognitive system handles the underlying symbolic structure, not just memorized wholes.

But this is also where the theory's central challenge lives — the one captured by Searle's Chinese Room. A system can manipulate symbols according to perfectly correct rules while understanding nothing. You can pass Chinese characters through a lookup table and return grammatically correct Chinese without comprehending a word. The objection: syntax is never sufficient for semantics. Formal symbol manipulation can mimic understanding without constituting it. CTM defenders respond in various ways — by arguing that semantics emerges from the system as a whole, or that the room is a misleading analogy for how real cognitive systems are structured. But the problem stands as the most serious internal challenge to the theory, and it motivates the next extensions: whether substrate matters, whether consciousness requires more than functional organization, and whether a sufficiently complex computational system could bridge the gap between symbol-shuffling and genuine understanding.

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 → Multiple Realizability → Computational Theory of Mind

Longest path: 98 steps · 639 total prerequisite topics

Prerequisites (6)

Leads To (3)