Thursday, November 3, 2016

Bid resolution, bit error and increasing entropy

They go together.  The general principle here is an input and output stream fill the pit, and are increasingly organized such that the typical input/output interactions set a representative samplin, a typical sequence. They become bunched together in bins aside nodes along the graph. As the input and output sequencves become known, their coherence becomes analiated, like anti-posi bodies, they trade.

The trading is forced, the pit is known to approach increasing precision, it will always dispense with the two matching colors within the bit error of the increasing  precision.  In other words, bets will resolve, or it is not a maximum entropy pit.  The maximum precision, in bits, depth on the graph, will be a mall number, and generally known plus pr minus  It is an impossibility for the pit boss to continue unless,it annihilates matching bets.  At that point, there is bit error, observed bids got rounded to the bin quant, within the bin, there were losers and winners.

The method of annihilation, and the informational principle, the red/green definition, makes the trading options inside the  pit boss configuration.  Bit error gains and losses are distributed between yhe bots, including the pit boss, or not, ot whatever; according to contract.  I think the S&L pit boss just bets the previous tree, or equivalently so.  Its demonstration of change is represented by a tree requant, prior that it is neutral.  Hence, it automatically takes gains and losses since its bets would be equivalent to trader bets, as per contract.  We distinguish between central banker and currency banker.

No comments: