bugfix-66

6 ms·

1.
by bugfix-66 4y ago
No, I mean https://www.amazon.com/Art-Computer-Programming-Combinatoria...
2.
by bugfix-66 4y ago
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."
3.
by bugfix-66 4y ago
That's right. There was no snark intended.
4.
by bugfix-66 4y ago
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 dazzling. It's like a guide to expressing (in non-obvious
5.
by bugfix-66 4y ago
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.
6.
by bugfix-66 4y ago
Look at how many times that program appears when you paste your question into Google. The language model was trained on it.
7.
by bugfix-66 4y ago
Named after the two companies that promoted it.
8.
by bugfix-66 4y ago
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 achievement. Now tell me, how many of the BUGFIX-66 pr
9.
by bugfix-66 4y ago
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.to/
10.
by bugfix-66 4y ago
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 sort".
11.
by bugfix-66 4y ago
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 correct OPTIONAL curly braces.
12.
by bugfix-66 4y ago
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 demonstrate understanding. Games that require yo
13.
by bugfix-66 4y ago
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 modern chip. Do your own test, and keep the result
14.
by bugfix-66 4y ago
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 itself got 11 points. Apparently, it is an o
15.
by bugfix-66 4y ago
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 point. The instruction allows you to multiply a*m b
16.
by bugfix-66 4y ago
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 instruction does: htt
17.
Show HN: Alan Mycroft's classic SWAR byte search technique(bugfix-66.com)
1 points by bugfix-66 4y ago|0 comments
18.
by bugfix-66 4y ago
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 arbitrary memory access within
19.
Show HN: Hack This Site(bugfix-66.com)
2 points by bugfix-66 4y ago|1 comments
20.
by bugfix-66 4y ago
This is based on Russ Cox's essay: https://research.swtch.com/gorace But, the code in Russ Cox's article does not race with the modern Go compiler.
21.
Circumventing Go's memory safety: Using a race to read/write arbitrary addresses(bugfix-66.com)
1 points by bugfix-66 4y ago|1 comments
22.
by bugfix-66 4y ago
A really tremendous varint/VLQ encoder (using a zig-zag encoding and an generalized base): https://bugfix-66.com/2c1df73cab89ec76d6fa10caf8a27c1fbe4d16... and the decoder: https://bugfix-66.com/1efa93a5
23.
by bugfix-66 4y ago
A more challenging code puzzle game: https://BUGFIX-66.com
24.
by bugfix-66 4y ago
I have a different Hacker News account for every one of my projects. It happens that the No-AI 3-Clause License became part of the BUGFIX-66 project. I'm sorry that upsets you, but I'm sure you'll get over it. Happy Thanksgiv
25.
by bugfix-66 4y ago
A necessary evil. You point out a cost. The benefits outweigh that cost.
26.
by bugfix-66 4y ago
Thank you. I see the Humans Only Clause is much more explicit about what is prohibited than the No-AI 3-Clause License, and furthermore directly states a licensing fee.
27.
by bugfix-66 4y ago
I'm presenting the license text in a creative and unusual way that real hackers might enjoy. If that confused you, or you consider it "obnoxious", then you are not the target audience. That's ok. Hacker News is not 100%
28.
by bugfix-66 4y ago
Thank you. Could you paste the Humans Only Clause here so we can read it? Here was my attempt to write a clause prohibiting language model training/inference: https://bugfix-66.com/7a82559a13b39c7fa404320c14f47ce0c304fa
29.
by bugfix-66 4y ago
Being able to read and understand x86-64 assembly (or PTX/SASS for an Nvidia GPU) is much more important than being able to write it. In practice, even when you're writing assembly, you're looking at reference assembly genera
30.
by bugfix-66 4y ago
This is a "broadword matrix multiplication" as described in Knuth's The Art of Computer Programming Volume 4A (exercise 55 in section 7.1.3). Here is a lecture where Knuth explains it: https://youtu.be/o22BAuQ

More ›