Search for "Recursion" in article titles:

1. Recursion: Recursion is the repeated application of a procedure or definition through reference to itself. There's a simple procedure for finding out whether a number is divisible by three. [100%] 2023-03-13 [Computer Science] [Mathematics]...
2. Recursion: Recursion occurs when the definition of a concept or process depends on a simpler or previous version of itself. Recursion is used in a variety of disciplines ranging from linguistics to logic. (Process of repeating items in a self-similar way) [100%] 2023-12-20 [Recursion] [Theory of computation]...
3. Recursion: Recursion occurs when the definition of a concept or process depends on a simpler version of itself. Recursion is used in a variety of disciplines ranging from linguistics to logic. (Process of repeating items in a self-similar way) [100%] 2023-11-24 [Recursion] [Theory of computation]...
4. Recursion: A method of defining functions studied in the theory of algorithms and other branches of mathematical logic. This method has been used for a long time in arithmetic to define sequences of numbers (progressions, Fibonacci numbers, etc.). (Mathematics) [100%] 2023-11-25
5. Recursion termination: In computing, recursion termination is when certain conditions are met and a recursive algorithm stops calling itself and begins to return values. This happens only if, with every recursive call, the recursive algorithm changes its state and moves toward the ... [70%] 2023-02-19 [Recursion]
6. Recursion (computer science): In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same problem. Recursion solves such recursive problems by using functions that call themselves from within their own ... (Computer science) [57%] 2023-11-25 [Theoretical computer science] [Recursion]...
7. Bar recursion: Bar recursion is a generalized form of recursion developed by C. Spector in his 1962 paper. [70%] 2023-09-13 [Recursion]
8. BCFW recursion: The Britto–Cachazo–Feng–Witten recursion relations are a set of on-shell recursion relations in quantum field theory. They are named for their creators, Ruth Britto, Freddy Cachazo, Bo Feng and Edward Witten. (Physics) [70%] 2023-10-05 [Quantum field theory] [Scattering theory]...
9. Mutual recursion: In mathematics and computer science, mutual recursion is a form of recursion where two mathematical or computational objects, such as functions or datatypes, are defined in terms of each other. Mutual recursion is very common in functional programming and in ... (Form of recursion) [70%] 2023-11-25 [Theory of computation] [Recursion]...
10. Double recursion: In recursive function theory, double recursion is an extension of primitive recursion which allows the definition of non-primitive recursive functions like the Ackermann function. Raphael M. [70%] 2022-11-26 [Computability theory] [Recursion]...
11. Polymorphic recursion: In computer science, polymorphic recursion (also referred to as Milner–Mycroft typability or the Milner–Mycroft calculus) refers to a recursive parametrically polymorphic function where the type parameter changes with each recursive invocation made, instead of staying constant. Type inference ... [70%] 2023-10-11 [Polymorphism (computer science)] [Recursion]...
12. Left recursion: In the formal language theory of computer science, left recursion is a special case of recursion where a string is recognized as part of a language by the fact that it decomposes into a string from that same language (on ... [70%] 2023-11-24 [Control flow] [Formal languages]...
13. Walther recursion: In computer programming, Walther recursion (named after Christoph Walther) is a method of analysing recursive functions that can determine if the function is definitely terminating, given finite inputs. It allows a more natural style of expressing computation than simply using ... [70%] 2022-08-02 [Recursion]
14. Induction-recursion: In intuitionistic type theory (ITT), a discipline within mathematical logic, induction-recursion is a feature for simultaneously declaring a type and function on that type. It allows the creation of larger types, such as universes, than inductive types. [70%] 2023-09-26 [Type theory]
15. Topological recursion: In mathematics, topological recursion is a recursive definition of invariants of spectral curves. It has applications in enumerative geometry, random matrix theory, mathematical physics, string theory, knot theory. [70%] 2023-09-08 [Topology] [Algebraic geometry]...
16. Topological recursion: In mathematics, topological recursion is a recursive definition of invariants of spectral curves. It has applications in enumerative geometry, random matrix theory, mathematical physics, string theory, knot theory. [70%] 2022-09-26 [Topology] [Algebraic geometry]...
17. Primitive recursion: A means of defining functions with natural number arguments and values. One says that an $(n+1)$-place function $f(x_1,\dots,x_n,y)$ is obtained by primitive recursion from an $n$-place function $g(x_1,\dots,x_n)$ and an ... (Mathematics) [70%] 2023-10-28 [Logic and foundations]
18. Panjer recursion: The Panjer recursion is an algorithm to compute the probability distribution approximation of a compound random variable \displaystyle{ S = \sum_{i=1}^N X_i\, }[/math] where both \displaystyle{ N\, }[/math] and \displaystyle{ X_i\, }[/math] are random variables and of special ... [70%] 2023-09-23 [Actuarial science] [Theory of probability distributions]...
19. Multiple recursion: A form of recursion using several variables simultaneously. The set of values of these variables is ordered lexicographically. (Mathematics) [70%] 2023-10-24
20. Transfinite recursion: A method of defining functions on ordinal numbers or, more generally, on sets endowed with an ordinal structure. The defining equation of transfinite recursion has the form $$ F(x) = G(x,F \uparrow x), \qquad (\star) $$ where $ F \uparrow x ... (Mathematics) [70%] 2023-10-23
21. Collective recursion: Collective recursion is a special type of tail recursion, having results produced during the recursive calls with nothing returned. One can optimize this type of recursion by executing the call in the current stack frame, rather than creating a new ... [70%] 2023-07-13 [Computer Science]
22. Anonymous recursion: In computer science, anonymous recursion is recursion which does not explicitly call a function by name. This can be done either explicitly, by using a higher-order function – passing in a function as an argument and calling it – or implicitly ... (Recursion without calling a function by name) [70%] 2022-01-10 [Recursion]
23. Induction-recursion: In intuitionistic type theory (ITT), a discipline within mathematical logic, induction-recursion is a feature for simultaneously declaring a type and function on that type. It allows the creation of larger types, such as universes, than inductive types. [70%] 2024-12-26 [Type theory]
24. Anonymous recursion: In computer science, anonymous recursion is recursion which does not explicitly call a function by name. This can be done either explicitly, by using a higher-order function – passing in a function as an argument and calling it – or implicitly ... (Recursion without calling a function by name) [70%] 2025-03-19 [Recursion] [Articles with example JavaScript code]...
25. Reduction (recursion theory): In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A {\displaystyle A} and B {\displaystyle B} of natural numbers, is it possible to effectively convert ... (Recursion theory) [57%] 2022-10-13 [Reduction (complexity)]
26. Forcing (recursion theory): Forcing in recursion theory is a modification of Paul Cohen's original set-theoretic technique of forcing to deal with the effective concerns in recursion theory. Conceptually the two techniques are quite similar: in both one attempts to build generic ... (Recursion theory) [57%] 2024-02-15 [Computability theory]
27. Minimal recursion semantics: Minimal recursion semantics (MRS) is a framework for computational semantics. It can be implemented in typed feature structure formalisms such as head-driven phrase structure grammar and lexical functional grammar. [57%] 2022-08-11 [Computational linguistics] [Natural language processing]...
28. Reduction (recursion theory): In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively convert a method for deciding ... (Recursion theory) [57%] 2023-10-09 [Computability theory]
29. Alpha recursion theory: In recursion theory, α recursion theory is a generalisation of recursion theory to subsets of admissible ordinals \displaystyle{ \alpha }[/math]. An admissible set is closed under \displaystyle{ \Sigma_1(L_\alpha) }[/math] functions, where \displaystyle{ L_\xi }[/math] denotes a rank of ... [57%] 2024-03-23 [Computability theory]
30. Index set (recursion theory): In the field of recursion theory, index sets describe classes of partial recursive functions, specifically they give all indices of functions in that class according to a fixed enumeration of partial recursive functions (a Gödel numbering). Fix an enumeration of ... (Recursion theory) [50%] 2023-11-28 [Computability theory]