Everything About ___
Live briefing

Everything about Recursive definition

Defining elements of a set in terms of other elements in the set

In mathematics and computer science, a recursive definition, or inductive definition, is used to define the elements in a set in terms of other elements in the set. Some examples of recursively definable objects include factorials, natural numbers, Fibonacci numbers, and the Cantor ternary set. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Recursive definitionA 5-minute orientation
  2. Skim a recent paper: Recursive definition and two edge-disjoint Hamiltonian cycles of bubble-sort star graphsInfluential work since 2022
  3. Pick up a classic book: The C Programming LanguageThe most-reprinted book on the subject
  4. Read the landmark paper: Formal model of internal measurement: Alternate changing between recursive definition and domain equationCited 27 times
  5. Go sideways: RecursionA closely related topic
  6. Go sideways: Recursion (computer science)A closely related topic

📖 Definitions

Noun A definition of a term within which the term itself appears, and that is well-founded, avoiding an infinite regress.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics