Examples of recursion in the following topics:
-
- This definition is valid because, for all $n$, the recursion eventually reaches the base case of $0$.
- Depending on how the sequence is being used, either the recursive definition or the non-recursive one might be more useful.
- Using this equation, the recursive equation for this geometric sequence is:
- Recursive equations are extremely powerful.
- Use a recursive formula to find specific terms of a sequence
-
- Human language is unique because it is generative, recursive, and has displacement.
- Specifically, human language is unique on the planet because it
has the qualities of generativity, recursion, and displacement.
- Human language is recursive.
- Obviously, the recursive abilities of
language are constrained by the limits of time and memory.
- Human language is also modality-independent—that is, it is
possible to use the features of displacement, generativity, and recursion
across multiple modes.
-
- To recursively elaborate previously learned procedural and cultural mathematical competencies, each emphases section will have the 5th emphasis on the Practical Procedures of this
level of mathematics.
-
- Sequences whose elements are related to the previous elements in a straightforward way are often specified using recursion.
- To specify a sequence by recursion requires a rule to construct each consecutive element in terms of the ones before it.
- The Fibonacci sequence can be defined using a recursive rule along with two initial elements.
-
- These are called recursive sequences.
- The recursive definition is therefore
- The recursive definition is therefore
- Therefore the recursive definition is
- Therefore the recursive formula is
-
- Recursively elaborate mathematics.
-
- Alternatives to coding include recursive abstraction and mechanical techniques.
- Recursive abstraction involves the summarizing of datasets.
-
- Phases can be iterative and recursive (meaning that they do not proceed linearly from one to the next; rather, earlier phases can be returned to for further improvement as needed).
-
- Phases can be iterative and recursive (meaning that they do not proceed linearly from one to the next; rather, earlier phases can be returned to for further improvement as needed).
-
- It can also be obtained recursively through the Fibonacci recurrence relation.