Recursive algorithms can be replaced with non-recursive counterparts. Iterative algorithms can be implemented by means of recursive predicates. Stacks are an important way of supporting nested or recursive function calls. OCaml lends itself to concisely expressing recursive algorithms. The MISER algorithm is based on recursive stratified sampling. Random outcomes are generated using a fractal recursive process. The algorithm can also be implemented in a recursive way. The Halting problem is decidable for lossy Turing machine but nonprimitive recursive. Unbound is a validating, recursive, and caching DNS resolver product from NLnet Labs. The diagonal lemma applies to theories capable of representing all primitive recursive functions. An intuitive approach is the parallelization of those recursive calls. Many mathematical axioms are based upon recursive rules. It functions as a recursive name server. DNS servers are not required to support recursive queries. Note the keyword codice 1 which denotes that the function is recursive.