Graph explorer

Explore the knowledge graph

Turing machine models Algorithm. Activate to inspect this relation.Finite automaton is analogous to Turing machine. Activate to inspect this relation.Computability depends on Turing machine. Activate to inspect this relation.Halting problem is part of Computability. Activate to inspect this relation.Lambda calculus is analogous to Turing machine. Activate to inspect this relation.Type theory is derived from Lambda calculus. Activate to inspect this relation.Type system is derived from Lambda calculus. Activate to inspect this relation.Operational Semantics applies to Lambda calculus. Activate to inspect this relation.Denotational Semantics applies to Lambda calculus. Activate to inspect this relation.Closure is derived from Lambda calculus. Activate to inspect this relation.Time Complexity measures Turing machine. Activate to inspect this relation.Space Complexity measures Turing machine. Activate to inspect this relation.Halting problem depends on Turing machine. Activate to inspect this relation.Turing machine is a Finite automaton. Activate to inspect this relation.Turing machine models Computability. Activate to inspect this relation.Church-Turing Thesis depends on Turing machine. Activate to inspect this relation.Church-Turing Thesis explains Computability. Activate to inspect this relation.Algorithm models Turing machine. Activate to inspect this relation.Halting problem applies to Turing machine. Activate to inspect this relation.ClosureLambda calculusTuring machineType theoryType systemOperational SemanticsDenotational SemanticsAlgorithmFinite automatonComputabilityTime ComplexitySpace ComplexityHalting problemChurch-Turing Thesis
Relationship types
Legend
  • Focused concept
  • Connected concept
  • Arrow points from cause / source to effect / target
  • A line with no arrow is a two-way relationship
  • Node colour marks the concept’s primary discipline
14 concepts19 relationships9 disciplines5 relation families

At a glance

A closure is a function together with the bindings of the free variables from its enclosing lexical environment.

Disciplines
Programming Languages
Role in the graph
Leaf concept
Relationships
1 · 1 relation families

Insights from this view

Structural observations about the concepts shown here — descriptions of this graph, not claims about the world.

  • This view connects 9 disciplines: Algorithms, Computational Complexity, Computer Science, Discrete Mathematics, Logic, Mathematics, Programming Languages, Software Engineering, Theory of Computation.
  • Algorithm is a bridge concept — viewed here through Algorithms, Computer Science, Discrete Mathematics, Logic, Mathematics, Software Engineering, Theory of Computation.
  • The connections here span 5 relation families.
  • Information explains 2 concepts in this view (Algorithms, Computational Complexity, Computer Science, Discrete Mathematics, Logic, Mathematics, Software Engineering, Theory of Computation).

Relationships as a list

The focused concept’s relationships. Pick another concept in the graph above to update this list.

Explore through a different lens

A lens is a deterministic projection of the graph. Pick a discipline, thinking pattern or journey to reframe the whole view.

By discipline

By thinking pattern

By journey

Concept collections

Concept collections are curated lenses onto the fabric — themed sets of ideas that recur across disciplines. They are not journeys; they are a way to read the graph.

About this view

What this is

Start from one concept and expand outward. The view never shows everything at once — click a node to refocus, filter by relationship type, or switch to an accessible list.

One fabric

3750 concepts and 5051 typed relations form one connected component — no isolated silo.

How to read it

Focus a concept, or apply a lens (discipline, mental model, journey) to see only the threads that matter.