mpiedrav

The idea was to consider the historical criticism of capitalism in a modern setting (e.g., how effective is the market in addressing economic inequality?). The discussion got out of control, though.

For instance, in Costa Rica (3.4 million voters) we just elected mayors nationwide and received trustworthy results within a couple of hours (reported using a party-independent app).

Caucuses are also run by the Supreme Electoral Court. Kind of an Election-as-a-service.

Also, Ben-Ari's "Mathematical Logic for Computer Science" and Pierce's "Software Foundations".

In 1976, still back in the USSR, I got a very serious case of food poisoning from eating raw fish. While in the hospital, in the state of delirium, I suddenly realized that the ability to add numbers in parallel depends on the fact that addition is associative. (So, putting it simply, STL is the result of a bacterial infection.) In other words, I realized that a parallel reduction algorithm is associated with a semigroup structure type. That is the fundamental point: algorithms are defined on algebraic structures. It took me another couple of years to realize that you have to extend the notion of structure by adding complexity requirements to regular axioms. And than it took 15 years to make it work. (I am still not sure that I have been successful in getting the point across to anybody outside the small circle of my friends.) I believe that iterator theories are as central to Computer Science as theories of rings or Banach spaces are central to Mathematics. Every time I would look at an algorithm I would try to find a structure on which it is defined. So what I wanted to do was to describe algorithms generically. That's what I like to do. I can spend a month working on a well known algorithm trying to find its generic representation. So far, I have been singularly unsuccessful in explaining to people that this is an important activity. But, somehow, the result of the activity - STL - became quite successful.