Peter's paper goes path searching

It is about how many characters i a code word need to be changed to get some other code word of the same size.  That is called the Hamming distance. If the allowed Hamming distance is bound, or some Hamming distance dis-allowed, then the trick is to find a partition of code words, by Hamming distance.

In our bot, this means the number of ways in which a bet remains, in the money. So Peter is going to use random graph selection with dependencies, he is looking for the lengths of paths through an encoder and decoder. That is our bot, traversing probability graphs to find the best spot to bet, on our behalf with hones and fairly measured probability graphs.

This is why Peter is the VP software in the bot company and owns 1/12 of banker coins. And this is why CurrencC should join the bot company.

But, anyway, this is where I like the idea of queueing on a graph. The partition of sets is a set of queues on the directed graph. The nodes are the probable outcomes in which the excluded sets have some adaptive variance, elasticity of set interaction is matched, and accumulation up the graph obeys an information metric rule, that guarantees the equipartition. The partition sizes being represented in the finite Skellam distribution.   Because elasticity is adjusted, we get a bubble overlap mechanism, the excluded sets are squeezed out of the graph. So the graph, going up, sorts the sets by hamming distance.  he number of sorts decreasing going up until a node is balanced; that is encode. Decode is the fermion graph, selecting the most probable source code words, going down the graph. But fermion queues are shorter, going down, then boson queues are going up. So, change the Elasticity ratio in : C^2-S^2 = Elasticity, elasticity rational. This is the effect of squeexing the hyperbolic angle, but the Skellam variance changes as set size increases, as does the information metric. In the match, we get various combination of school girls sizes. But they are hierarchical, as in the Hurwitz. Irrational number theorem.  Set the elasticity to the first Lagrange, get a set of queues, then recombine decompose those queues with the second Lagrange. I think. But the solution is there, that is the link to number theory.

I think, but I will think better after finishing the paper.