Recursion
Recursion occurs when the definition of a concept or process depends on a simpler or previous version of itself.
At a glance
Key signals
0% cross fields · reaches 4 more
- Mathematics
- Discrete Mathematics
- Computer Science
- Explanation
- Examples
- Misconception
- Sourced relations 2
- Attribution
Dependencies
What this concept builds on and what it makes possible — derived from the atlas’s dependency, causal and structural relations, not from every related edge.
Enables · leads to
Fibonacci sequencedepends onRecursionEstablished
Fibonacci sequence depends on recursion.
Mechanism: The Fibonacci sequence is defined by recursion: each term is the sum of the two before it, so the rule refers back to itself.
- Wikipedia (English & German editions) verifiedmoderate evidence
Structural role & consequence
Interpreted from the current atlas graph — what the connections mean, not just how many there are.
Currently dark in the atlas: no key date stored · 2 of 2 of its relations lack claim-level evidence.
atlas representation · Describes the current Thinking OS representation, not the state of the world.
Exercises 2 annotated mental models — a concept that connects several thinking patterns.
curated · Curated annotations, not a derived measure.
Structural neighbourhood: 2 → 18 → 83 concepts reachable within 3 hops.
structural · Structural reach — being reachable is not the same as being understood.
All 2 of its relationships stay within its own discipline — a field-specific concept in the current atlas.
structural · Structural graph analysis — not a claim of importance, causation or history.
cross-field
2 within-field, 0 cross-field
Strengths & constraints
Constraints
- Evidence coverage currently thin in the atlas — few of its relationships carry claim-level evidence. atlas representation
- No dated history stored — the atlas records no key date for this concept. atlas representation
Conditions
- Read structurally — most of its relationships carry no external evidence yet, so claims here are graph-derived. structural
Dependency radial
What this concept builds on (left) and what it makes possible (right) — derived from dependency and causal relations.
What builds on this
1 concept build on this directly, 1 in total, across 1 discipline.
Structural downstream reach along dependency edges — not a claim of historical necessity.
Seen through each discipline
How this concept sits in each of its fields — derived from its real connections in the graph, not asserted.
Through this lens it connects to Algorithm and Fibonacci sequence.
Through this lens it connects to Algorithm.
Through this lens it connects to Algorithm.
What it looks like
Concrete cases that make this idea recognisable in the real world.
Factorial by recursion
factorial(n) = n × factorial(n−1), with the base case factorial(0) = 1. Each call shrinks n by one until it hits 0 and unwinds — finite because the base case is guaranteed to be reached.
Check yourself
A quick check against a common misconception. Nothing is scored — picking the tempting-but-wrong answer just flags an idea worth revisiting.
Which statement is correct?
Recursion means a function that calls itself forever.
A correct recursion always has a base case that stops it, and each call must move toward that base case. Without a reachable base case it never terminates and overflows the stack — the bug, not the technique.
This idea also appears in…
The same structure shows up in other disciplines. These are real recurrences drawn from the graph — a starting point for asking “what carries over, and what changes?”
Emergence22 disciplines · 17 concepts
Recursion & self-similarity5 disciplines · 4 concepts
Concepts
shares a mental model
shares a mental model
shares a mental model
shares a mental model
shares a mental model
shares a mental model
Mental models at work here
Emergence
When many simple parts interacting by simple rules produce a pattern or behaviour that none of the parts has on its own.
Ask: is this property in the parts, or only in how they interact?
Recursion & self-similarity
A thing defined in terms of smaller copies of itself — solve the small case and the same rule builds the whole, often looking similar at every scale.
Ask: can I reduce this to a smaller version of the same problem, plus a base case to stop? Zoom into a fractal and you see the whole again.
- Connects 2 other ideas across 3 disciplines.
- A cross-disciplinary bridge — its connections reach into 4 other fields.
- Most of its connections are of the “Dependency” kind.
- It exercises 2 reusable thinking patterns.
Derived from the graph’s real structure — observations, not a score.
Sources
- Wikipedia (English & German editions) verifiedmoderate evidence
- Wikidata verifiedmoderate evidence