integer floats with remainder theory - copyright RSThe float is formed of 2 integers...
One being the integer and the remainder being the floating component....
thusly we need two integers per float for example 2 32bit integers will make one single float instruction....
integer A : Remainder B
A + B = float
(A + B) x (A²+B²)
= float C dislocating A and B by a certain number of places = a float that travels as the integer.
Expansion data sets:
A1 : B1
A2 : B2
Ar : Br
F1 : Bf1
F2 : Bf2
Fr : Bfr
A : Integer
F : Float
r : Remainder
The data set expansion can be infinite and the expansion of the data set doubles the precision,
With the remainder... infinite computation = infinite precision.
Not only that but the computation can be executed as an Integer or as a float or indeed with both.
Relevance is that on computers there are a lot of integer registers; Float also..
Also the data can be compressed in ram without using larger buffer widths.
copyright Rupert Summerskill
COP-Roll : (c)Rupert S
ROLL Operation Syntax : RS :(Integer & Float)
Processing Cache (displacement) Operation Roll Arithmetic Maths : For
Multiplication, Division, Addition & Subtraction : P-COR-SAM
Addressable by Compiler update, Firmware update, CPU/GPU Rules
Firmware, Bios, Operating System & Program/Machine Learning.
Machine Learning will considerably enhance Cache & Processor routine
operations efficiency & make rules for all developers & firmware
AI Machine Learning Optimization : https://is.gd/3DMLSorcerer
In a single loop a multiply of a float point precision of under 1 for example 0.00001 requires that:
In Integer float :
Multiply of a sum such as 15.05 * 3 is 2 operations:
(15 x 3) + ((roll 0.05 left 2 places)*3) = R=(5 x 3) + 45
In other words : 2 storage values R remainder (the float component) & the number,
However multiplication of a float such as 0.01 is a division in one example & a multiply roll in another,
Roll is a memory operation in CPU terms & is a single processor loop push
In all operations where division is banned we have to decide whether the operation is multiples or division of base value 10 or 1,10,100>,
Such an operation can be carried out by addition or subtraction or roll, Values such as 200* ,
Require multiple additions under the multiply is banned principle.
Multiple sets of memory arrays in a series parallel is the equivalent of multiplication through addition,
Subtraction through addition requires inverting the power phase of a single component array.
Thus we are able to addition and subtraction all sums ? traditional math solves have done this before,
Roll operations are our fast way to multiply;
However arrays of addition & subtraction are a (logical fast loop)..
Full Operation in a single cycle, Because there is no sideways roll.
However direct memory displacement between 010100 & 101000 can use a cache to displace a 1,
Such an arrangement such as a 4 digit displacement cache to roll the operation on memory transfer.
Displace on operation (cycle 2) does minimize operations.
Having that cache further up the binary pipeline does reduce the number of roll cache modifier buffers that we need,
However the time we save & the time we lose & the CPU space we lose or gain.. depends specifically how limited the Roll Cache is.
(c) Rupert S https://science.n-helix.com
Optimisation & Use:
Compiler books & reading : https://science.n-helix.com/2017/04/boinc.html