In a boarding school there are fifteen schoolgirls who always take their daily walks in rows of threes. How can it be arranged so that each schoolgirl walks in the same row with every other schoolgirl exactly once a week?he encode-decoder interaction maintains a sequence of school girls, it runs the boarding school problem with increasing sized set of unique girls. Its the grand ensemble. Decode is feed back, return one of the girls to the smaller set size. Encode makes bigger set sizes? School girls are hot positions size X and cold positions size 1/X. A rate governed, locally additive constrained queueing system. It is Paul Romer's transportation problem. The banker bot problem, the quantum entanglement problem. But it is ongoing self adaptive statistics.
A a betting problem, bets are placed and they run up the tree, being encoded. If an encode causes a node rebalance, the most likely bet on that node is computed and sent
The path that is in the most likely position wins the fermion payout. This is how bitcoin block chin works, except an encode is finding the next prime number. In our situation we find the next prime to some precision, and the bot is spreading around precision.
So where is banker bot?
The bot is a plot in front of the Cal Tech alumni, they have Matilde held captive. We still have Dannica and Peter, the two other essential ingredients; and the Alt-M team, they are free. We have proof of the technology. We want hardware security and the team. If you let me stew and shuffle, I will likely jump on my c machine and make the bot. Then the Cal Tech alumni can cry and weep.
Patent issues on graph processing.
None, zero zip. Banker bot recognizes secure hardware key patents.
No comments:
Post a Comment