Many important and classical problems in mathematics and computer science are defined, or have solutions in terms of recursive definitions: the factorial function, the natural numbers, many divide-and-conquer algorithms, and parsers for programming languages all use recursion in fundamental ways. A function is defined using recursion if in its definition, it makes calls to itself. The great advantage of recursive definitions is their simplicity and directness. Their one major drawback however, is how quickly the depth and complexity can increase to the point of making your computations intractable.

Cited by 0

Recursion

John Schwartzman · Apress eBooks · 2025

The mathematical sequence factorial is defined recursively as

Cited by 0

Recursion

David J. Lobina · 2017

Abstract This book provides a comprehensive account of the role of recursion in language in two distinct but interconnected ways. First, it examines how recursion applies at different levels within a full description of natural language. Specifically, it identifies and evaluates recursion as: a) a central property of the computational system underlying the faculty of language; b) a possible feature of the derivations yielded by this computational system; c) a global characteristic of the structures generated by the language faculty; and d) a probable factor in the parsing operations employed during the processing of recursive structures. Secondly, the volume orders these different levels into a tripartite explanatory framework. According to this framework, the investigation of any particular cognitive domain must begin by first outlining what sort of mechanical procedure underlies the relevant capacity (including what sort of structures it generates). Only then, it argues, can we properly investigate its implementation, both at the level of abstract computations typical of competence-level analyses, and at the level of the real-time processing of behaviour.

Cited by 13

Recursion

Coen de Groot · Apress eBooks · 2023

Cited by 0

Recursion

2007

Cited by 0

Recursion

Alexander Shen · Springer undergraduate texts in mathematics and technology · 2009

Cited by 0

Recursion

2015

Cited by 0

Recursion

Subrata Saha · 2023

Cited by 0

Recursion

Cordelia Hall, J. M. O’Donnell · 2000

Cited by 0

Recursion

Fabrizio Montesi · Cambridge University Press eBooks · 2023

The syntax of choreographies is enhanced with the possibility of writing and invoking recursive procedures, yielding the language of Recursive Choreographies. This opens the door to modelling protocols that allow for retries and data streams of unbounded length. The language of process implementations and the notion of EPP are updated accordingly.

Cited by 0

recursion

William Blum · 2009

Cited by 0

Recursion

John Hunt · Undergraduate topics in computer science · 2023

Cited by 1