LPisGood

Google Pixel / Android are very popular. Chromebooks also did well.

Wow! This is very cool. I had an idea for something very similar to this when I found out the US federal government offered API keys, maybe three or four years ago. I found that while Congress did list bill revisions as they were made the format and retrieval of these was not an easy task. The idea was that I wanted to look at any line of any bill and see who proposed it that particular line’s inclusion.

For the record, and feel free to steal it if you like it, I called it “G(overnm)it-blame”

Linear programming admits a worst-case polynomial time algorithm.

It is notable that simplex, especially dual simplex is often better in practice, especially for integer linear programming with branch and bound because you only have to slightly modify the parent optimal basis in simplex vs entirely restarting or refactorizing for interior point methods.

That is unfortunately not the case

> As a non-profesional (everyone here)

I wouldn’t be so sure of that

Subexponential(poly(n)) may be exponential in n

> To be clear though, it does not imply that NP is subexponential

Is there a subset of NP problems for which a subexponential algorithm would witness the entire NP class being subexponential?

I said the same thing in another thread and someone compared it to no one forcing you to own a smart phone. I will preempt that argument by saying the community is motivated to verify these results because they are important to the field.

It is the canonical NP complete problem.

Actually we can do classical theory of strategic interaction here. There will be a range of acceptable negotiated settlements to both parties since both parties have some estimate E of the expected balance of power resulting after a war. If A is the amount of surplus value Anthropic expects to lose in a war and H is expected amount of value humanity expects to lose in a war, the the range [max(E - H, E - A), min (E + H, E + A)] gives a whole continuum of mutually acceptable settlements.

Now there will be bargaining friction given that any power sharing agreement with Anthropic will likely increase their future capacity and thus the future expected balance of power, but maybe AI has a long enough utility horizon that we should all expect to be dead by the time it realizes the long-term expectation advantage

That doesn’t make any sense to me. Access to AI doesn’t make you more credible. At best, it makes you more productive.

I feel like this comment contrasted with the incredible movie releases this since ~May is just not holding water.

This is like how OpenAI solved some hard math problem in only a few hours.

> If a firm spends $99k on compute to replace a $100k engineer and produces 5x the output, how is that not a 5x increase in aggregate labor productivity?

It sounds like they spent 99k to replace 5 100k engineers, which means they could charge 499k for it.