Alright, I admit that I skimmed, came across a bunch of GD code at the beginning and assumed that you just got lucky with a very greedy approach, sorry :P. The

Alright, I admit that I skimmed, came across a bunch of GD code at the beginning and assumed that you just got lucky with a very greedy approach, sorry :P. The update function you wrote on the distribution space is continuous, and distribution space is compact (since there's no way to have more than N of any letter), so there is necessarily at least one fixed point. Fixed points could still be sources though, right? It clearly wasn't, but I'm curious to know if you got lucky, or if you merely didn't get unlucky. I wonder how effective your code would be on the following self descriptive sentences (base j). For instance when j=2, "100 1,11 0" has 4 ones and 3 zeros as described. Does your code consistently find solutions as you increase j? At what point does the computation become unfeasible?