BOOLEAN Algorithms/BOOLEAN Mathematical Functions 2025

Terms of Reference

Refer to the post, Terms of Use Agreement Xerqon Technologies, WIX Blog 2025, for early, legal due diligence.

The following are candidates for firmware logic. The y form the basis of all logic gates, at an algorithm level.

(1)  Positive Variable Algorithm/Function

A   =   ( pow ( ( x ,   1/2 ) ,   2 ) + x ) / 2 ,

f(x)

f(x) returns only the positive of any variable which substitutes x.

(2) Inversion Function

A = ( -x / x + 1) / 2

f(x) ,

0 ;

1;

(3)  Boolean OR Gate

A = pow ( x ,   1/2 )  +  1,

f(x) ,

0 , 1 ;

1 , 0 ;

(4) Boolean NOR Gate

A = ( - pow ( ( x ,   1/2 ) ,   2 ) / pow ( ( x ,   1/2 ) ,   2 ) + 1 ) / 2

This a simple and truly mathematically integrative set of Boolean Algorithms/Functions.

© Xerqon ABN 97661410108 2025