Viewing profile — bugfix-66

No, I mean https://www.amazon.com/Art-Computer-Programming-Combinatoria...

You don't test on the training set. Everybody in ML (e.g., me) knows that. But that's what we're seeing. I'm saying: "Here's a test outside the training set."

[flagged]

That's right. There was no snark intended.

I seriously doubt this appeals to the modern Hacker News crowd, but it might appeal to a couple of you: Published in October 2022, The Art of Computer Programming: Volume 4B is daz…

The training set is full of code for these problems. Put your query into Google and see how many thousands of answers appear. Your tests are in the training set.

Look at how many times that program appears when you paste your question into Google. The language model was trained on it.

Named after the two companies that promoted it.

It was trained on numerous Leetcode solutions (question/answer), which you can find on GitHub. People are proud of their Leetcode efforts: they post their solutions, as if it is an…

Radix sort is also very simple, e.g., https://bugfix-66.com/834f0677c85b23c0bf1047d3654ab7c27ff054... And djb's vectorized sorting networks are pretty great: https://sorting.cr.yp.…

Now do it for an algorithm+explanation the training set doesn't contain a million copies of, please. For example, substitute "The Burrows-Wheeler Inverse Transform" for "bubble sor…

Look at Section 8 and Section 9 here: http://tug.ctan.org/info/tex-nutshell/tex-nutshell.pdf How is ChatGPT's answer wrong? The regex is matching square brackets instead of the cor…

A different kind of programming puzzle: https://BUGFIX-66.com The idea is that you read and understand a small piece of code (full of useful techniques) and make a small change to …

Similarly, you can turn off bounds-checking in Go like this: go build -gcflags=-B and see if it helps. Generally the assembly looks better, but it doesn't really run faster on a mo…

43 days ago I asked this question: https://news.ycombinator.com/item?id=33215740 This question got voted down everywhere I discussed it on Hacker News, but somehow the submission i…

It's just a fixed point instruction. Fixed point multiply: a*m times b*m yields (a*b)*m = a*m * b*m / m In the above, m is the fixed point 1. For example, 65536 for a 16.16 fixed p…

Look at the Green Arrays F18, the "conclusion" that Forth reached: https://www.greenarraychips.com/home/documents/greg/PB003-11... Here's a clear description of what each instructi…

This is based on Russ Cox's essay: https://research.swtch.com/gorace The code in Russ Cox's article does not race with the modern Go compiler. But it's simple to fix that. Given ar…