Recursive procedures and base cases
Self-calls reduce a problem toward a terminating case.
Key knowledge
A recursive procedure calls itself, directly or through other procedures. For a terminating recursive computation, calls must reach a base case; a common argument is that a nonnegative integer measure decreases strictly along each recursive call. The base result is then used as calls return.
Conditions and scope
- Declare the allowed inputs, base cases and a well-founded decrease argument.
- A self-call alone does not ensure termination; actual machines also have finite resources.
Sources · 2
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Self-calls reduce a problem toward a terminating case.
2026-10-10 · Independent Physics and Measurement reference editor (AI editorial bounded review). Exact bounded introductory reference claims and this practical concept inventory are approved after closure. Existing university/research proof and source scopes remain separate; no universal knowledge-completeness or experimental-validation assertion.
Foundational review
2026-10-10 · Independent AI editorial inspection of this new compact reference entry, its equations, applicability, sources and knowledge connections.
Sources from other places
Scope or convention differs
A base case and decreasing nonnegative integer factorial argument lead to termination in the mathematical model.
Python still has recursion limits; arbitrary indirect recursion requires a separate argument.
University of Helsinki, Agile Education Research Group
- Python Programming MOOC · Recursion FinlandEnglish
Recursive factorial; Recursion depth
- Python Programming MOOC · Recursion
Entry details
Permanent link to this entry ↗- Record identity
- foundation-info-recursive-procedures
- Revision
- foundations-audit.1
- Structured reference record
- Foundational core completion