I quite the hieroglyphics game. But I can describe it in more detail, right here.
The bot always keys off the incoming bet, find the appropriate note and updates the no arbitrage price for that node. Then it emits down stream gains and upstream losses, the residual goes to the appropriate bot and the next no arbitrage price is updates. When branches are in 'out of the money' the bot will create or destroy a branch. Basically it warps the graph to fit the tanh curve, spreding out precision (or error variance) evenly.and the complexity of the incoming prices get reflected in the spectral decomposition done by the bot. The graph should always approach the minimum spanning tree. Start simple, then add branch and cut functions. Ant bot node should see its cosh updated twice as often as its sinh, so sinh is the echo, it is magnetism. Otherwise, top to bottom, bottom to top, multiple streams, whatever, add it in and have fun.
Bit coin coders should figure this out, except we use 'almost probable', as in Ito's calculus. Error is accepted, the thing we adapt. Look at bit coding block processing, look at Huffman encoders, especially run time variable window Huffman encoders. Find the folks doing that stuff, and find the mathematicians who know graph theory, hyperbolics, Lagrange, Lucas polynomials and sequences and maximum entropy systems. Physicists are getting a real handle on this stuff.
I am retired from coding, I freak at the very though of rummaging through this Ubuntu and trying to recover all the software infrastructure. I am not amining to be a gazillionare.
No comments:
Post a Comment