3 bit adder

google test


( -> E){
dual A[32], A2[32], A1[32](515321);
style=”padding-left: 60px;”(A -> A1){A1 = 214013 * A};
(A1 -> A2){A2 = 2531011 + A1};
(A2 -> A, E){A = mod(A2, 32); E; = mod(A2, 32);}


NCL enables a model of flow computation entirely in terms of fully determined logical  relationships.

in contrast to logical relationships, with measured delays and time determination

Represented as a directed graph of coupled oscillations, each individually striving to oscillate.

in contrast to a passive sequence enlivened by a single oscillating clock

In which wavefronts of active data spontaneously flow from oscillation to oscillation through a background of emptiness.

in contrast to passive data manipulated by state machine and clock or by sequenced instructions

Each oscillation contributes a NCL combinational function and maintains the result,

in contrast to Boolean logic cones and registers

all of which the flowing wavefront accumulates to a realization of the computation.

in contrast to a mathematician with pencil and paper flowing data values through an algebraic equation or a clock driven state machine flowing data values through registers or a sequenced program flowing data values through static memory.

 The  table below indicates how the components of the flow computation model relate to the more familiar models of computation.

Oscillation ===> clock – sequence control
NCL completeness coupling ===> register – memory
NCL coupling logic ===> Boolean logic cone –
Coupling structure ===> state machine –
sequence/memory allocation


Omi logo


Omi logo2