Concepts are connected by relationships drawn from Pask's Conversation Theory. Start here if you're new.
Why these terms? The relationships between concepts use vocabulary from
Gordon Pask's Conversation Theory. Pask — who studied under Ashby — developed the idea of
entailment meshes: networks showing how concepts necessarily lead to other concepts.
We use his terminology so the same vocabulary works across all thinkers on this platform.
Read each relationship as a sentence: "Concept A [RELATIONSHIP] Concept B"
ENTAILS Logical Implication
If A is true, then B necessarily follows. You cannot have A without B.
A → ENTAILS → B = "If A, then necessarily B"
Computability ENTAILS Definability — If something is computable, it must be precisely definable.
DERIVES_FROM Prerequisite / Dependency
To understand A, you must first understand B. B is a prerequisite for A.
A → DERIVES_FROM → B = "To understand A, you need B first"
The Turing Machine DERIVES_FROM Effective Procedure — You can't understand Turing's model without first understanding what an effective procedure means.
GENERALIZES Abstracts / Extends
A is a more abstract, general, or developed form of B. A takes B to a higher level.
A → GENERALIZES → B = "A is a more abstract form of B"
Universal Turing Machine GENERALIZES Turing Machine — The universal machine isn't just a specific Turing machine; it generalizes to simulate all others.
PARTICULARIZES Instance / Specific Case
A is a concrete example or specific instance of B. A makes B tangible.
A → PARTICULARIZES → B = "A is a specific instance of B"
Stored Program Computer PARTICULARIZES Universal Turing Machine — Physical computers are concrete realizations of the universal machine concept.
CONSTRAINS Limits / Bounds
A places limits on B. A defines the boundaries within which B operates.
A → CONSTRAINS → B = "A limits what B can achieve"
The Halting Problem CONSTRAINS Machine Computation — Some questions cannot be answered algorithmically, no matter how powerful the machine.
ENABLES Makes Possible
A creates the conditions for B to exist. Without A, B wouldn't be possible.
A → ENABLES → B = "A makes B possible"
Discrete State Machines ENABLES Artificial Intelligence — The concept of a machine with discrete states makes the theoretical possibility of machine intelligence conceivable.
CONTRASTS Differs From
A and B are different in important ways. Understanding the contrast illuminates both.
A ↔ CONTRASTS ↔ B = "A and B differ in important ways" (bidirectional)
The Imitation Game CONTRASTS Traditional Logic Tests — Turing's operational definition of intelligence differs fundamentally from formal logical approaches.
ANALOGOUS_TO Structural Similarity
A and B share structural or functional similarities, often across different domains.
A ↔ ANALOGOUS_TO ↔ B = "A works like B" (bidirectional)
Unorganized Machines ANALOGOUS_TO Neural Tissue — Random networks of logic gates share structural properties with biological neural networks.
REQUIRES Necessity
A needs B to function or be meaningful. B is essential to A's existence.
A → REQUIRES → B = "A needs B to function"
Machine Learning REQUIRES Training Mechanism — Education of machines requires an organized process to modify behavior through experience.
EXTENDS Builds Upon
A builds on and broadens B, taking it beyond its original scope.
A → EXTENDS → B = "A builds on and broadens B"
Morphogenesis EXTENDS Discrete State Machine Theory — Turing's work on biological pattern formation extends discrete mathematics into continuous dynamical systems.
ILLUSTRATES Concrete Example
A is a concrete example or illustration of B's principles.
A → ILLUSTRATES → B = "A is a concrete example of B"
Leopard Spots ILLUSTRATES Morphogenesis — Biological patterns like leopard spots demonstrate how mathematical principles generate natural forms.
CORRESPONDS Parallel Development
A and B develop in parallel or have structural correspondence across different thinkers.
A ↔ CORRESPONDS ↔ B = "A parallels B"
Turing's Computability CORRESPONDS Church's Lambda Calculus — Both independently formalized what it means to compute, arriving at equivalent concepts.
HISTORICAL Historical Lineage
A and B share a historical connection or development lineage.
A ↔ HISTORICAL ↔ B = "A and B share a historical lineage"
Turing Machines HISTORICAL Modern Computers — The theoretical foundation of 1936 directly shaped the development of practical computing machines.
Tip: Follow DERIVES_FROM chains to find prerequisites. Follow GENERALIZES to go deeper. Follow PARTICULARIZES to find concrete examples. Only CONTRASTS, ANALOGOUS_TO, CORRESPONDS, and HISTORICAL are bidirectional — all others are directional.