Thinking·OS

Graph explorer

Explore the knowledge graph

Algorithm models Turing machine. Activate to inspect this relation.Algorithm is a Sequence. Activate to inspect this relation.Approximation algorithm applies to NP-completeness. 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.Computability depends on Turing machine. Activate to inspect this relation.Computability theory depends on Turing machine. Activate to inspect this relation.Computational Complexity depends on Computability. Activate to inspect this relation.Computational complexity theory is part of Algorithm. Activate to inspect this relation.Decidability is part of Computability. Activate to inspect this relation.Decidability is part of Computability theory. Activate to inspect this relation.Finite automaton is analogous to Turing machine. Activate to inspect this relation.Finite-state machine is analogous to Turing machine. Activate to inspect this relation.Gödel's incompleteness theorems is analogous to Halting problem. Activate to inspect this relation.Halting problem applies to Decidability. Activate to inspect this relation.Halting problem applies to Turing machine. Activate to inspect this relation.Halting problem 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.NP-completeness depends on Reduction (complexity). Activate to inspect this relation.NP-completeness is part of Complexity Class NP. Activate to inspect this relation.NP-completeness is part of Computational Complexity. Activate to inspect this relation.NP-completeness requires Polynomial-Time Reduction. Activate to inspect this relation.NP-completeness is part of Computational complexity theory. Activate to inspect this relation.PCP theorem applies to NP-completeness. Activate to inspect this relation.Polynomial-Time Reduction is a Reduction (complexity). Activate to inspect this relation.Reduction (complexity) applies to NP-completeness. Activate to inspect this relation.Space Complexity measures Turing machine. Activate to inspect this relation.Time Complexity measures 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.Turing machine models Algorithm. Activate to inspect this relation.Computational ComplexityComputabilityNP-completenessTuring machineChurch-Turing ThesisDecidabilityHalting problemReduction (complexity)Complexity Class NPPolynomial-Time ReductionComputational complexity theoryApproximation algorithmPCP theoremAlgorithmFinite automatonLambda calculusSpace ComplexityTime ComplexityComputability theoryFinite-state machineGödel's incompleteness theoremsSequence
Relationship types

14 concepts viewed through this lens. Bridge concepts connect this view to Algorithms, Artificial Intelligence, Biochemistry, Bioinformatics….

Legend
  • Focused concept
  • Connected concept
  • Bridge concept (just outside the lens)
  • 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
22 concepts32 relationships13 disciplines5 relation families

Computational Complexity

Open concept →

At a glance

Computational complexity classifies problems by the time and space resources needed to solve them.

Disciplines
Theory of Computation
Role in the graph
Cross-disciplinary bridge — reaches Computational Complexity, Computer Science
Relationships
2 · 2 relation families

What am I looking at?

In this lens (14)

Bridge concepts (27)

Just outside the lens — they connect it to other context.

Insights from this view

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

  • This view connects 13 disciplines: Algorithms, Bioinformatics, Computational Complexity, Computer Science, Data Structures, Discrete Mathematics, History, Logic, Mathematics, Molecular Biology, 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 3 concepts in this view (Algorithms, Bioinformatics, Computational Complexity, Computer Science, Data Structures, Discrete Mathematics, History, Logic, Mathematics, Molecular Biology, 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

ChemistryBiologyPhysicsMathematicsComputer ScienceGeologyMineralogyEconomics

By thinking pattern

Bayesian updatingCause and effectCompoundingConservationConstraintsDefense in depthDiffusion & spreadEmergenceEnergy transformationEntropy & irreversibilityEquilibriumFeedback loopIncentivesInformationLevels & hierarchyModularityNetworksOptimizationOscillationProbabilityRecursion & self-similarityScaleSignal vs noiseSource–pathway–receptorStocks and flowsSymmetry & invarianceThresholds & tipping pointsTrade-offsTriangulationVariation & selectionWaves

By journey

From a Leaf to the ClimateWhy Music Moves UsHow Machines LearnReasoning about a Leaf and the Climate

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.