BY LETTER
Recursive Problem Solving
The process of defining or expressing a function or procedure in terms of itself. Typically, each iteration of a recursive-solution procedure produces a simpler (or possibly smaller) version of the problem than the previous iteration. This process continues until a subproblem whose answer is already known (or that can be readily computed without recursion) is obtained. A surprisingly large number of symbolic and numerical problems lend themselves to recursive formulations. Recursion is typically used by game-playing programs, fractal aioids, and many AIs.
Appears in Topics
Development Notes
Text by M. Alan Kazlev from KurzweilAI
Initially published on 22 December 2001.
Initially published on 22 December 2001.
