Search Results for ""

Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule ...

Some computations allow shortcuts which can be used to speed them up. Consider the operation of raising a number to a positive integer power. It is possible, for example, to ...

Let x->y and u->v be two rules of a term rewriting system, and suppose these rules have no variables in common. If they do, rename the variables. If x_1 is a subterm of x (or ...

A diagonal matrix D=diag(d_1,...,d_n) sometimes also called the valency matrix corresponding to a graph that has the vertex degree of d_i in the ith position (Skiena 1990, p. ...

The Delaunay triangulation is a triangulation which is equivalent to the nerve of the cells in a Voronoi diagram, i.e., that triangulation of the convex hull of the points in ...

A Turing machine is called deterministic if there is always at most one instruction associated with a given present internal state/tape state pair (q,s). Otherwise, it is ...

Elliptic alpha functions relate the complete elliptic integrals of the first K(k_r) and second kinds E(k_r) at elliptic integral singular values k_r according to alpha(r) = ...

In the course of searching for continued fraction identities, Raayoni (2021) and Elimelech et al. (2023) noticed that while the numerator and denominator of continued ...

Let S be a nonempty set, then a filter on S is a nonempty collection F of subsets of S having the following properties: 1. emptyset not in F, 2. If A,B in F, then A ...

A folding function is a function that maps the integers Z={...,-3,-2,-1,0,1,2,3,...} onto the nonnegative integers Z^*={0,1,2,3,...}. This type of function arises naturally ...