Incrementation Or Square Wave Algorithm In One Brief Line

Incrementation is available on all current computers. Its substantially briefer form has updated version is now released below, in early format. Indicated, immeditaely below, is an equivalent model of how a computer operates already.

Introduction To “x” As Natural Time Evolution

It is important to note that computers all operate on electrical physics laws. Incrementation, in physics nomenclature is indicated at (1) and (2). It is converted to early stage, IT format in (3). “clock()” is the IT variable which replaces the physics variable, “t”.

The unassigned (missing) data type unit for all IT variables and constants is the time unit of milliseconds or ms. That means that each number or constant, “a” is actually “a millisecond” and “x” is “θ millisecond”, while “i” is “i millisecond”.

The 0 constant has validity when multiplied by a variable or by an interval of variables. It only equals zero when multiplied by a constant. Do not attempt to simplify and effectively delete the clock() variable.

That will lead to a fruitless constant result of only 1/M_Pi. The computer time-sequences through the algorithm from far left to far right, in BEDMAS sequence order. See BEDMAS in the blog article From BODMAS Sequencing to BEDMAS Law.

The Algorithm

(1) x, θ = 2 * Pi * f * t ,

(2) i = x/2 * Pi ,

(3) i = ( ( 0 * ( clock() + 1 ) - clock() ) + ( ( clock() + 2 ) - ( clock() + 1 ) ) / 2 * M_Pi

Methodology Note

***BEDMAS, rather than BODMAS, must be adhered to. The interval must not be simplified. Simplification will produce no result consistent with the described algorithm. BEDMAS remains an active rule for the timestamp subtraction, as immediately above. In the example, incrementation will occur with a time precision of 0.001 seconds. The clock will procede to populate its output in increments of 1.

© Xerqon Pty Ltd  2026