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 moreArtificial 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 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 ComputabilityFunctionalismMultiple RealizabilityComputational Theory of Mind

Longest path: 98 steps · 639 total prerequisite topics

Prerequisites (6)

Leads To (3)