Search Results for ""

To define a recurring digital invariant of order k, compute the sum of the kth powers of the digits of a number n. If this number n^' is equal to the original number n, then ...

A recursive process is one in which objects are defined in terms of other objects of the same type. Using some sort of recurrence relation, the entire class of objects can ...

The term "recursive function" is often used informally to describe any function that is defined with recursion. There are several formal counterparts to this informal ...

A quadrature (numerical integration) algorithm which has a number of desirable properties.

A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

A set T of integers is said to be recursively enumerable if it constitutes the range of a recursive function, i.e., if there exists a recursive function that can eventually ...

A set A of integers is recursively isomorphic to set B if there is a bijective recursive function f such that f(A)=B.

Determination of whether predicate P(x_1,...,x_n) is true or false for any given values of x_1, ..., x_n is called its decision problem. The decision problem for predicate ...

An extended rooted binary tree satisfying the following conditions: 1. Every node has two children, each colored either red or black. 2. Every tree leaf node is colored ...