PROTON COMPUTING

in proton computing we focused on repulsive force as unit of 1 and 0 with charge of proton like 1 pow 1.6*10pow19 and same wtith electron like 1 pow -1.6*10pow19 if proton repuslive force wokr over elcteorn same time elctron repuslive with proton so we know that i class there will be 2 ,6,8,18 electron so we make a fast repulsive force to exact repulsive force to dwon repusliev force in the class of electron so by the proton calculas we find the slope in a manners so rooton if forces it froces is 1 and 0 and same elctron for it self is 0 and for otehr is 1 but both ns reverse manners because proton si psoitve and elctron is negative repulsive gates wil be ''proton bits p =(1p 0p)e for electron bit e =(0e 1e)p (0e 1e) (0p 1p) so by that ther is operation oevr tehse bit that called the bit for gates then gates oepration will profmr over these bits because tehy claledthe repulsive force bits so operating ov by p.e e.p p.p e.e then it gerates a quanlification teher si protn calculas we tae the dit product and corss product and junction prodcut for these bits why ther si zero in there becau eof protn is psitive chrage taht means it charge is soldi matures how these bit is eprform because p.p is wprking herer inetrrelation of rpton is also work in repulsive forces same with electrons that they cosmume repletion of theses those p=(1pow 1.6*10pow19 0pow 1.6*10pow19) (0pow-1.6*10pow-19 1pow 1.6*pow-19) so there is takken log of them t delcares the charges taht works over proton repulsive bits in bit p and e p=(p works as repulsive but p dont work with p in repulsive for p) (electron dont wokr with electron but electron work with repulive with proton why they take in shpae of 1 0 0 1 bcause 1.1 =1 matrices values whenw etaken a log thenw erech udndifned and defines values of it , then thers is 1 pow cos p 0 pow cos p 0 pow cos p 1 pow cos p same with othr 1 pow sin p 0 pow sin p also for e same with 1 pow tan p 0 pow tan p also for e ths caled charge degree to conevrt charge in degree by 1 degree maturity so w perfomr by chnage log the operation ovr repulsove bit we take a log of proton charge and log of electron charge log 1.6*10pow-19 = logexpnenetgradef 1.6+logexpoenent grade f 10 pow-19 = log 1.6+ -19log 10 then a conversion of log in exponentials then conevrt charges i froce expenetial form of log then it comes in the nature of repulsive force then these repulsive force is wroked in such manners we make al froce in expoenent forms so two repulsiev force genrates when it gensrts two repuslive force then it we extratct th repusive foce the unit will remaisn i the from of 1 and 0 and 0 and1 that claled th erpuslive bits repuslive bits called for the rpton comptuing the gates will works in there in differnt manners if eletonbit and collide iwth protn bit tthen in dot prduction the ist generets a symmertircc bit so expoenet for chagrs willl be tehre as id sucessd to produce froce bits and we differ as then we get 1e and 1p perform 0p 0e ep perform bits proton computing gates this bits is matrices and vector performs where is the force exponent is works with different diffenrt firts vector force (fp f0) (f0 fe) that kind of froce is relventely works then gates is announces in repulsion the value will arise if fp has dominant froce then fe is also apply the rverisble force so bits is create how fp.log fe =1 log fe pow fp fp.log 1 =0 log 1 pow fp fp.log 1 =0 fe.log fp =1 log fp pow fp(self intimation due to electron or log fp pow fe if log charge /log charge 1.6 10pow -19 or+19 for the charge 1.6 + 19 log 10/-(1.6 -19 log 10) =-1 1.6+19log 10 /1.6 +19 log 10 =1 dp/dq pn the charge basis now hoewe conprises gate around proton comptuing it direct to repulsion firts bits 1p 0p 0e 1e same second bits 0e 1e 1p 0p so it works by repuslive force if force is mature then the bits id mature if (log fe)pow fp 0 0 ( log fp)pow fe = (1p 0p (0e 1 e) we take logthim processing gates tow wokrs this is only bit and force is juts a creation and operator log((log fe)pow fp taking a log (log fe pow fp ) log (fp log fe) partial differntaion log (fp.1/fe) equal force due its 0 to prudce by log those applied a singel force then log (1) = 0 so 0 is got by that and 1 is got by fe.log fp parital diffenrtiaiton against wrt to fp fe/fp =1 so the gates is will perform over operational bits so howw e garsp bit by and operator bits is given now heres is starts so the gates perom by and gates bcause we need powers of foces between and gates thsi and gates will work on repulsive forces matrices (fp 0) (0 fe) fp = fp.log fp y=log fp fe = fe.log fe then fp.d/dfp log fp = fp/fp=1(paritla differntiation) it includes because fe.d/dfp log fe = fe/fe =1 (partail differentaition) so gates will creates by and operation (1p 0p) (0e 1e) (0e 1e) and (1p 0p) row to column and opration will perform after getting te logging results this is ne wkind of gates that wokrs like that so and operation perfomr with that matrices it gives like mechanisme here speical and gates perform 1p 0p with 0e 1p = 0pe 1pe 1p 0p with 1e 0p = 0ep 0 ep (0pe 1 pe ) (0pe 0 pe ) same with (0e 1e) (1p 0p) (1p 0p) and (0e 1e) (0 0) (1ep 0) same with (0e 1e) and (1p 0p) (1p 0p) (0e 1e) result (1ep 0ep) (1pe 0pe) how that valeus comes it comes by and operaton means row to column apply and oeprators withgoutgainingtehsum its formulisations

Comments

Popular posts from this blog

HADMARD MATRIX WITH NEGATION AND ACCPETANCe

gpu or people are running wrong in all about whether it and whether its any company what ther are saynig they are in intiaally career of stage of of gpu saying that so :from royal socie_y i am saying to tycoon company

A.I. CASH or MACHINE LEARNING CASH