Recursive

  • (adj): Of or relating to a recursion.

Some articles on recursive:

AMD Fire Stream - Limitations
... Recursive functions are not supported in Brook+ because all function calls are inlined at compile time ... Using CAL, functions (recursive or otherwise) are supported to 32 levels ... The same problem occurs for recursive functions ...
Super-recursive Algorithm - Definition
... Burgin (2005 13) uses the term recursive algorithms for algorithms that can be implemented on Turing machines, and uses the word algorithm in a more general sense ... Then a super-recursive class of algorithms is "a class of algorithms in which it is possible to compute functions not computable by any Turing machine" (Burgin 2005 107) ... Super-recursive algorithms are closely related to hypercomputation in a way similar to the relationship between ordinary computation and ordinary algorithms ...
Loop Variant - Practical Considerations
... equally powerful construct such as a recursive function call, it is no longer capable of full μ-recursion, but only primitive recursion ... Ackermann's function is the canonical example of a recursive function that cannot be computed in a loop with an integer variant ... In terms of their computational complexity, however, functions that are not primitive recursive lie far beyond the realm of what is usually considered tractable ...
Tennenbaum's Theorem - Recursive Structures For PA
... A structure in the language of PA is recursive if there are recursive functions + and × from to, a recursive two-place relation < on, and distinguished constants such that where ... Because the isomorphism must be a bijection, every recursive model is countable ...
Adequate Pointclass
... set theory, a pointclass can be called adequate if it contains all recursive pointsets and is closed under recursive substitution, bounded universal and existential quantification and preimages by recursive ...