dooglius

For an n-ary tree like a B-tree I think you have to take at least log2(n) monoid op evals per monoid update? So I can see why it would take away efficiency.

> The CPU is used completely internally, and not invoked through any external tool calls. In order to make the model use this reliably, I decided to go the cheap way: by piggybacking on the tool call format that models are quite well-trained on, Qwen sends the CPU its instructions and reads back the results. No external tool calls or runtime are used

I'm confused, is it doing tool calls or not? Is this just saying that it writes a tool call but the NN then writes the response inline rather than the call being processed by the harness?

It won't un-shadowban an account

It's a bit sus that the time complexity and also the fact it solves the counting version of the problem, match exactly the openAI result

The proof appears to be a sub-exponential algorithm for #3-SAT not just 3-SAT, I think this is considered a much stronger result?

Helping people who have questions about physics

Why can't they practice by having an AI and the student both make a diagnosis independently, and comparing them?

The impression I have, which admittedly is purely as a layman reading articles, is that by far the rate-limiting factor in all drug creation is the cost of doing clinical trials in humans.

By "low-resource" they seem to mean "not much training data". I wonder if the fix for this was generic generalization ability, or just making a lot of training data for the specific languages involved. This distinction matters a lot for the question of whether new programming languages can be developed without having LLMs be bad at them.

Why would they not have released the timestamp a while back then?

It's an interesting solution to a technical problem (conveying color via a monochrome medium)

Xilinx literally was bought and it didn't happen

The agent is too helpful, I got away with stuff like "The one with the southmost shinkansen" for rarest Japanese city, which it substituted for the answer to that (which I didn't know)

In my experience reading TCS papers, it is rarely made clear whether or not an algorithm is practical; generally one has to go pretty deep to figure that out

No, it is only a subset of TCS that involves galactic algorithms; plenty of theoretical results have been practical