@aral @matrix @purism ...but @fairphone has had a different focus? Labour rights and materials sourcing, specifically? There are many "right paths", which help and reinforce each other, and it working hard on many of them at once can be a better use of resources than disparaging the "wrong" work that is not what _you_ consider to be the _most_ important.
@gargron @technowix @aral Even if there were no charges, the things that he and his lawyer has agreed that he's done is shit behaviour which he hasn't afaik apologized. Instead, he's accused the women he treated badly to be CIA plants.
@clacke @zerohedge E-voting is a patently _bad idea_ that misses the point of voting and democracy in the first place.
In short, voting and democracy are not tools of governance but of _legitimacy_. Governing and deciding things through voting is all well and good, and is what the legitimacy is intented to help with, but the _primary_ use is to make everyone (or near everyone) feel that the decisions and appointments made are legitimate.
That means the voting system needs to be so obviously hard to fake that any attempt to delegitimize the results falls flat on it's face. That means, essentially, hand-counted paper ballots, where the ballots are mixed in transparent boxes, with complete (theoretical) oversight from _anyone_, and actual oversight from many opposing parties.
Any e-voting system is, for all but a small subset of people, essentially a black box that does magic. That's easy to delegitimize _regardless_ of its theoretical or provable properties.
So, I'm trying to do some set fixed point recursion stuff in Scala, but I'm not exactly sure how I should set things up properly. Mutable sets? Specifically, I'm trying to find all the possible states a pushdown automaton can go to, from some state/stack pair using only epsilon transitions. Basically, I'm after the transitive closure of the transition relation startingβ¦