PhineasRex

This is a bad test. The alternative to algorithmically target ads is not totally blind ads, the alternative is direct ad-buying which targets based on context.

Buying ads on the NYT Health section is a form of targeting. It's also a much lower noise targeting compared to programmatic.

You can implement cache ttls with an Apollo link. See https://github.com/kamilkisiela/apollo-link-maxage for an example.

When I was in school we used cards but you could still tell who was on assistance because they got a different/worse lunch than everybody else.

You're assuming both sides have equal opportunity to cheat. Democrats' base is composed largely of minorities who are easier to disenfranchise. Republicans' base is largely middle class white people.

Sure, if Democrats could prevent middle class whites as a group from voting, they would; they can't. Replublicans absolutely can price poorer black people out of voting.

In the USA you have to register in advance for the electoral roll (which is tied to your SSN or DMV number) and show up with photo ID in these states. If voter fraud were occuring people would, as you say, notice that their vote had been stolen. This is why the photo ID requirement seems superfluous.

> you can't write a simple for loop or do i/o

  for [1..10] 
      print

Trivially refuted.

The efficiency gap is just a measure of the actual effect of gerrymandering in an election, it doesn't say anything about how to draw a district for future elections.

Compactness tells us nothing about the effects of gerrymandering. Less compact districts correlate with more gerrymandering but that doesn't tell us whether that gerrymandering was effective. Compactness could be a useful tool to limit the effects of gerrymandering when drawing districts.

This is conceptually the same as a Gap Buffer, it just uses a different memory layout.

I've heard more than one person argue against automatically generated encoders/decoders since it's easy to accidentally introduce breaking changes to your API by renaming a record field / class method.

If that's your view then Elm's approach is a plus for the language since it eliminates a potential pitfall.

This comes up every time somebody complains about Monopoly but even with auctions the game is still far too long and ends well after the winner is apparent.

Don't feel too sad about it, he launched Ando which is the same thing but faster and with better food quality.

I work at a company with multi-gigabyte tables and ALTER TABLE is still easy to pull off, we just use tools the community has built for larger tables. It's one of the most unfounded fears I've heard in the industry.

I live in NYC and likewise have never had to scan my ID. Scanning my ID would seem really odd to me if a landlord ever asked for it.

Where I work our core rendering algorithm which runs several times on every page load used naïve string concatenation. When I initially wrote it I knew string concatenation was inefficient but never got back to it and for 99.9% percent of cases it didn't matter! We finally hit that 0.1% case and after optimizing the algorithm, it didn't make a dent on our overall performance numbers at all.

The biggest impact to our performance has been switching one JSON serialization library for another, no algorithmic knowledge needed, just basic benchmarking skills.

> Silent explicit type conversions are essentially unsafe.

This is a contradiction, something cannot be both silent and explicit.

Mutual tail call optimization requires VM level support in general but can be accomplished within a compiliation unit (module) via inlining.

It looks like tail call optimization only works in simple situations.

    let rec foo i = if i < 0 then "foo" else bar (i - 1)
    and bar i = if i < 0 then "bar" else foo (i - 1)

    function foo(i) {
      if (i < 0) {
        return "foo";
      }
      else {
        return bar(i - 1 | 0);
      }
    }
    
    function bar(i) {
      if (i < 0) {
        return "bar";
      }
      else {
        return foo(i - 1 | 0);
      }
    }

It would be nice to get a warning when tail calls cannot be optimized.

"gypsy" is an ethnic slur that refers to the Romani people.

While you can count very high using this method, it's quite difficult to make some of the numbers. I've found the optimal tradeoff to be base-6; using one hand to keep track of the first position and the other the second position.

It helps that Haskell was based on Miranda and the committee deferred to Miranda whenever they could not agree on something. This is opposed to the typical committee solution of adding both ideas or a sub-par compromise.

Scala is like C++ where some features are dangerous. We've had significant problems with parts of the standard library and had to resort to banning them and writing our own alternatives.

Having the type-system statically verify that your API is correct and that your usage of it is correct, but oof, that syntax is quite hard to read. I wonder if you could use Template Haskell to generate that from an easier-to-read routes file similar to Yesod.

"While often derided as a toy"

Javascript is not a toy; toys are fun.

This exists. It is called Datalog.

Be warned: Neptune's Pride has the fatal flaw (or killer feature, depending on who you ask) of occurring in real time. Later in the game, as it speeds up, players who log in more often gain a tactical advantage.

The best source for the default commands is the dvtm man page.

Thanks, I had not seen abduco. I'll have to try it out.

For those who find tmux a bit arcane and screen a bit too primitive, I've found dvtm+dtach to be an excellent terminal multiplexer and session manager.

I did this as well and was rather disappointed with the reality.

I wonder if there are enough open source bikes for a worthwhile comparison.

I run Linux on a Macbook Pro (late 2013). It works remarkably well considering this hardware came out a few months ago. The only thing that doesn't work are the Thunderbolt ports (they work for everything except monitors, which crashes the machine after ~10 minutes).