HackerTrans
TopNewTrendsCommentsPastAskShowJobs

bugfix-66

no profile record

Submissions

[untitled]

2 points·by bugfix-66·4 वर्ष पहले·0 comments

Show HN: Alan Mycroft's classic SWAR byte search technique

bugfix-66.com
1 points·by bugfix-66·4 वर्ष पहले·0 comments

Show HN: Hack This Site

bugfix-66.com
2 points·by bugfix-66·4 वर्ष पहले·1 comments

Circumventing Go's memory safety: Using a race to read/write arbitrary addresses

bugfix-66.com
1 points·by bugfix-66·4 वर्ष पहले·1 comments

Show HN: Makeshift GPU tensor core using 64-bit CPU integer math

bugfix-66.com
2 points·by bugfix-66·4 वर्ष पहले·1 comments

Show HN: Averaging the Corresponding Fields of Two Integers

bugfix-66.com
1 points·by bugfix-66·4 वर्ष पहले·1 comments

Show HN: Improving on Daniel Bernstein's Libsecded

bugfix-66.com
1 points·by bugfix-66·4 वर्ष पहले·1 comments

Show HN: Lidar Obstacle Detection in 50 Lines of Go

bugfix-66.com
2 points·by bugfix-66·4 वर्ष पहले·1 comments

Lidar obstacle detection algorithm from a Git repo leaked onto Tor

bugfix-66.com
1 points·by bugfix-66·4 वर्ष पहले·1 comments

Show HN: The No-AI 3-Clause License (explicitly prohibits, e.g., GitHub Copilot)

bugfix-66.com
2 points·by bugfix-66·4 वर्ष पहले·7 comments

Ask HN: License to prohibit training of systems like Microsoft Copilot

39 points·by bugfix-66·4 वर्ष पहले·42 comments

Flexible Varint/VLQ: Variable-length bytewise integer encodings in Go

bugfix-66.com
3 points·by bugfix-66·4 वर्ष पहले·1 comments

The ancient Finnish predictor data compressor. Smallest compressor ever?

bugfix-66.com
35 points·by bugfix-66·4 वर्ष पहले·31 comments

[untitled]

1 points·by bugfix-66·4 वर्ष पहले·0 comments

Rarely used shortest path algorithm simpler and more powerful than Dijkstra's

bugfix-66.com
1 points·by bugfix-66·4 वर्ष पहले·1 comments

Breadth-first search with buffer ping-pong

bugfix-66.com
1 points·by bugfix-66·4 वर्ष पहले·0 comments

XOR Swapping for Fun and Profit

bugfix-66.com
1 points·by bugfix-66·4 वर्ष पहले·0 comments

The simplest and fastest balanced binary search tree: Top-down hash treap in Go

bugfix-66.com
3 points·by bugfix-66·4 वर्ष पहले·1 comments

Excuse Me Sir, Would You Like to Buy a Kilo of Isopropyl Bromide? [pdf]

library.sciencemadness.org
3 points·by bugfix-66·4 वर्ष पहले·2 comments

Space-filling curve: Mapping 3D space onto 1D space, preserving proximity

bugfix-66.com
2 points·by bugfix-66·4 वर्ष पहले·1 comments

comments

bugfix-66
·4 वर्ष पहले·discuss
bugfix-66
·4 वर्ष पहले·discuss
No, I mean https://www.amazon.com/Art-Computer-Programming-Combinatoria...
bugfix-66
·4 वर्ष पहले·discuss
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."
bugfix-66
·4 वर्ष पहले·discuss
[flagged]
bugfix-66
·4 वर्ष पहले·discuss
That's right. There was no snark intended.
bugfix-66
·4 वर्ष पहले·discuss
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 ways) all kinds of problems as some variation on Exact Cover (or Boolean Satisfiability) and using wicked tight little general-purpose backtracking solvers to solve them.

If you want a peek, watch Knuth's 2018 lecture on Dancing Links Exact Cover:

https://youtu.be/_cR9zDlvP88
bugfix-66
·4 वर्ष पहले·discuss
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.
bugfix-66
·4 वर्ष पहले·discuss
Look at how many times that program appears when you paste your question into Google.

The language model was trained on it.
bugfix-66
·4 वर्ष पहले·discuss
bugfix-66
·4 वर्ष पहले·discuss
Named after the two companies that promoted it.
bugfix-66
·4 वर्ष पहले·discuss
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 problems can it solve?

https://BUGFIX-66.com

Copilot can solve a few of the simple ones at the beginning (simple matrix multiplication, simple radix sort, etc., that appear often in the training data, and some of the harder ones whose solution appears on GitHub, e.g., the uncorrected prediction/correction compressor/decompressor whose solutions were front-page on Hacker News).

But as you go down the list, into material outside the training set, the language model won't be able to solve it.

Try it. Paste the tile, the introductory text, and the unfixed code, and see whether the omnipotent AI can solve these (quite straightforward) problems. For how many does it need the hint?
bugfix-66
·4 वर्ष पहले·discuss
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/
bugfix-66
·4 वर्ष पहले·discuss
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".
bugfix-66
·4 वर्ष पहले·discuss
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. Unseparated arguments aren't handled. The regex for the id is also wrong. The leading slash is correct, but other than that, the whole fucking thing is wrong!

And of course it can't handle macro calls within the macro arguments (nesting).

It's just an absolute clusterfuck, from top to bottom. The chatbot gave its user a useless piece of garbage, and Hacker News doesn't know enough to throw it away. Instead, we parade it around like some great success!

Fooled by a language model.
bugfix-66
·4 वर्ष पहले·discuss
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 you to write the code are limited to rehashing the same old tired algorithms... reverse a string and other sequence techniques, edit distance and dp variants, optimization by binary search and evaluation, etc., the standard leetcode stuff. Basically, useless wankery you will never use. The competitive programming standards.

If you don't have to write it, just understand it, the game can cover some very interesting new algorithmic terrain. It becomes part book, part game. Like Hacker's Delight: The Game.
bugfix-66
·4 वर्ष पहले·discuss
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 results in mind next time somebody on Hacker News dismisses Go because of the "overwhelming cost of bounds checking".
bugfix-66
·4 वर्ष पहले·discuss
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 offensive question to some silent, pro-censorship part of the population here. Today I'll ask it again, and I hope somebody will respond in a useful way:

QUESTION:

I write software for parallel processors at a hardware/software company you've heard of. I am located in California but many of my coworkers are located in China (roughly half the team).

We are directly affected by the American government's severe new CPU/GPU export restrictions.

It seems to me that America is preparing for a period of cold war, or worse.

It's time to start thinking about contributing to the American war effort by writing high-performance military computing systems.

For example, SIMD particle filters for hypersonic weapons, or low-latency convolutional neural networks for battlefield devices.

So, Hacker News: What company is the best place to do this work? What team?

Does anyone here already work in this field?
bugfix-66
·4 वर्ष पहले·discuss
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 by b*m and then divide by m, renormalizing your fixed point result.

Chuck Moore thinks nobody needs floating point because fixed point is sufficient!
bugfix-66
·4 वर्ष पहले·discuss
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:

https://colorforth.github.io/forth.html

Hilariously, the system has no logical OR, only AND and XOR and NOT, because "Inclusive-or is rarely needed."

This system was designed by Chuck Moore, father of Forth. Here is an entertaining video of him explaining the F18A stack machine and programming system:

https://youtu.be/0PclgBd6_Zs

This is such a simple machine. I am planning to make a tiny emulator for my site. One could probably write an emulator in 80 lines of Go (one goroutine for each of the 144 cores).
bugfix-66
·4 वर्ष पहले·discuss
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 a Go process under Linux, can you see how to terminate the process and return 0 to the system?

Like calling os.Exit(0) when package os is unavailable.