Introduction As with tautology checking and complementation, the fast prime generation algorithm uses a recursive “divide-and-conquer” approach. Given an initial cover, the algorithm recursively divides the cover into smaller pieces until termination conditions are met. Results are then returned and reassembled into a final solution. For prime generation, this solution is the set of all prime i...

Introduction As with tautology-checking and complementation, the fast prime generation algorithm uses a recursive “divide-and-conquer” approach. Given an initial cover, the algorithm recursively divides the cover into smaller pieces until termination conditions are met. Results are then returned and reassembled into a final solution. For prime generation, this solution is the set of all prime i...

The sequences generated by neuronal recurrence equations of the form xHnL ! 1A⁄j!1 h aj xHn jL qE are studied. From a neuronal recurrence equation of memory size h that describes a cycle of length rHmLä lcmIp0, p1, ... , p-1+r HmLM, a set of rHmL neuronal recurrence equations is constructed with dynamics that describe respectively the transient of length OHrHmLä lcmHp0, ... , pdLL and the cycle...

We study properties of operators defined on the space E+(p) of right half-infinite sequences with entries chosen from Zp where p is prime. The operators in question allow solution of the problem of finding predecessor states for certain cellular automata evolutions and they can be thought of as discrete integration with respect to sequence index. These operators are self-accumulating, not solip...

BACKGROUND Since the advent of cardiopulmonary bypass, many efforts have been made to avoid the complications related with it. Any component of the pump participates in occurrence of these adverse events, one of which is the type of prime solution. In this study, we aimed to compare the effects of 6% hydroxyethyl starch 130/0.4 with a commonly used balanced electrolyte solution on postoperative...