Your pricing model seems unconventional: I'd not cap at $50, let bigger companies pay your salaries. Also maybe consider letting small teams (e.g. 5) have a free plan.
> Local governments have no desire to spend resources negotiating SSL/TLS with every single smartphone in their area when things explode, rivers flood, or people are poisoned.
That's one horrible argument, though. The cost of a text-based protocol on ethernet, over TCP greatly outweighs the cost of the encryption process.
Yes, of course encrypting things will increase computational requirements yet the cost is negligible in comparison to the problem being solved (stopping the trade of personal data).
It's hard for me to associate a privacy champion with these statements.
My LL(k) recursive descent parser cannot handle left recursion without incurring in a O(n³) worst case time-complexity. OP please fix. I expect a solution until next week. Thank you.
If I wrote a natural number calculator in Agda; would all my numbers be represented as lists of successions from zero or can the compiler convert them to two's-complement integers as we know and love them?
In case the compiler can do that conversion: is it is programmed to do that for some subset of numeric types or can it infer an optimal binary representation of a value somehow?
On the other hand, if they really were represented as lists then I presume this language is intended as purely academic work and has no application in a production environment. Am I wrong?
Thanks. I am referring to, for instance, the 'method notation' introduced in that article.
I think I know what you mean by chunking. It is my understanding that it is a counter-productive thing, though. Just like how with 'frameworks' imperative programmers lose perception of the technical debt they incur by not knowing what their code actually does.
Maybe this line of thought is not universal but I'd presume the majority of programmers would be afraid to submit code to a project where they don't really know the notational mix and syntactic sugar in use.
Why do Haskell programmers see it as a good thing to package their abstractions in syntactic sugar?
Stop doing that. It makes it incredibly difficult to participate -- you basically need to learn 3 syntaxes on top of Haskell's own to contribute to any non-trivial project.
That's the real problem; they don't know what to do about it, but they'll rather do anything instead of nothing. Either it's gonna be a lot of hot air or turn out for the worse.
What's funny is that Google already operates as separate legal entities in different European countries (though some countries share one HQ and hence legal identity).
How they plan to further "break it up" I can't imagine.
Any side chain must therefore be able to generate currency out of the blue and on-demand. This might be possible to do in other protocols but not bitcoin. So the symmetry is basically lost. am I missing something?
> Though [Hikaru Nakamura] is ranked seventh in the world, he seems to consider himself Magnus Carlsen’s chief rival, as evidenced by this November 2013 tweet in which he equates Carlsen with a mythological necromancer.
>> Starting to realize that I am the only person who is going to be able to stop Sauron in the context of chess history. - @GMHikaru
As a Swiss citizen I don't understand how anyone from a first-world country would like to move to the USA. It's a downgrade in every aspect.
Giving up democracy, social-security, the practical absence of crime for a job in a country where every other Tuesday someone goes on a killing-spree, where people go to the doctor for moar Vicodine, where police will kill you for a donut. Nope.
Edit: changed englishman to briton. Thank you, commenters.
You are right yet Go is much closer to C than Erlang in syntax, type system and memory-representation. Go is so close to C in fact, that its compiler is a modified C compiler.
Therefore I'd bundle it with C and D rather than Erlang.