atn34

9 ms·

1.
by atn34 1mo ago
Amateur numbers. I can build a legacy codebase in an afternoon
2.
by atn34 2mo ago
One of my professors used an example like this to encourage you to pause if you ever find yourself doing something like "maybe if I just flip this < to > the tests will pass". The space of incorrect programs (even ones that
3.
by atn34 2mo ago
Then you run the risk of overfitting to whatever seed you picked. I think fixing a seed is probably a good idea most of the time but it’s worth considering
4.
by atn34 3mo ago
I've got a gitea instance and a systemd timer polling for issues assigned to my bot. The systemd timer clones the repo etc and spawns the agent in a restricted environment where it has a private localhost (enforced by systemd), and the
5.
by atn34 9mo ago
The original developers (before Apple bought the company) used Visual Studio on Windows
6.
by atn34 10mo ago
> If you wrote a function that takes a PRNG and generates a random object, you already have a function capable of enumerating all objects. Something often forgotten here: if your PRNG only takes e.g. a 32-bit seed, you can generate at mo
7.
by atn34 10mo ago
I actually started a collection of annoying bugs I’ve seen in the wild. I give the llm the buggy implementation and ask it to write a test that catches it. So far not even a frontier model (Claude Sonnet) can do it, even though they can fin
8.
by atn34 1y ago
I want to make a Birds Aren't Real[0] style t-shirt that says "Floats Aren't Real" [0]: https://en.wikipedia.org/wiki/Birds_Aren%27t_Real
9.
by atn34 2y ago
The natural recursive implementation is exponential, and the memoized version is O(n)
10.
by atn34 2y ago
> provided you understand the semantics of your target architecture Unless you're writing inline assembly or intrinsics or something like that, the semantics of your target architecture are quite irrelevant. If you're reasoning