Thinking·OS

Graph explorer

Explore the knowledge graph

Analysis of algorithms is a Computational complexity theory. Activate to inspect this relation.Computational complexity theory is a Computability theory. Activate to inspect this relation.Computational complexity theory is part of Algorithm. Activate to inspect this relation.Turing machine models Algorithm. Activate to inspect this relation.Computability theory depends on Turing machine. Activate to inspect this relation.NP-complete is part of Computational complexity theory. Activate to inspect this relation.NP-completeness is part of Computational complexity theory. Activate to inspect this relation.Class P is part of Computational complexity theory. 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.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.BQP (quantum complexity) is part of Computational complexity theory. Activate to inspect this relation.Halting problem applies to Decidability. 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.Decidability is part of 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.Computability theoryComputational complexity theoryDecidabilityTuring machineAnalysis of algorithmsAlgorithmNP-completeNP-completenessClass PBQP (quantum complexity)ComputabilityHalting problemFinite automatonLambda calculus
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 concepts21 relationships9 disciplines5 relation families

Computability theory

Open concept →

At a glance

Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees.

Disciplines
Computer Science · Logic
Role in the graph
Cross-disciplinary bridge — reaches Algorithms, Computational Complexity, Theory of Computation
Relationships
3 · 2 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.
  • Computability theory is a bridge concept — viewed here through Computer Science, Logic.
  • 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

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.