NEW CHEMICAL BONDING AUTOMATA FOR QUANTOM AND ATOMIC COMPUTING AND
in it automata every state bond with another state by the bonding accuracy imagine ee have 1n0n or anbn
then so in it we settled the bonding with state where could in classical automata we dont comprise the bonding but here tw o state will share bonding like (a-2n) (b+3n) then 2n and 3n will be loose then bonding with with 3n and decrease in 2n will go then like this way we reduce bonding to reach 0 and reach to 1 means till the staye cant reach either 0 or 1 means full automata\
INTHIS AUTOMATA:->
in this aitomata one state with another state have strength bondings from left to right and right to left,
in dual nature thnein this strength there will binding of eletcorn sharing means shares electron or prton and nrutron
means numebr that will shares on streghth line of them
for exmaple we know taht automic power of hydroegen sytate is two and clrine is 17 but thye shares dultuoe on is for negative and on so for positve 1 and 1 but on the line of stregth same way this automata will work on atomic shareness
so if we hhave anbn then a toatl strngth and b total starget and then share of of if we codneir der am si grter then an then
so am-an then an stregth then bm-bn then bn sterghet then prticpaitng eletcorn or shared states
in bonding based automata we balanced and imbalanced states in whihc we fullfill by arrow bonding placement by arrows and it depends on states stregth that how much it could balanced with in automata so in it states have stacks and quque of expression accoridn to electron and proton and neutron then we make interact posistively chrged and negatively charged and neutral charged
if there is quantom in which satte is entagle by proton and electron and neurton of one satte and then combined fatcor with another states as above discussed
Comments
Post a Comment