bustermellotron

6 ms·

1.
by bustermellotron 17d ago
There is a pre-release book on O’Reilly called “AI-Native Software Engineering” that has three chapters on spec driven design. That is where I found out about openspec. The skills facilitate SDD, although what that actually means is vague:
2.
by bustermellotron 24d ago
He posted about using ChatGPT to transcribe PDFs when it first became popular. So he’s been enthusiastic about LLMs for a while.
3.
by bustermellotron 24d ago
Is there an easy way to do this with eg codex? It seems like eg sol agents can’t spawn Luna subagents, so eg a “code research” subagent can save the main agent’s context, but can’t save tokens necessarily. (I suppose a tool to call codex CL
4.
by bustermellotron 24d ago
I also found LSP like skills to usually have no advantage over rg. The agent needs to read the code to understand it; navigation is a small portion of that.
5.
by bustermellotron 24d ago
Similar for ponytail, I don’t know if it saves tokens, but there is less output to read (and usually less over engineering). Occasionally I have to push for more complex code, but that is much nicer than constantly asking for simpler code.
6.
by bustermellotron 24d ago
I just went through a lot of benchmarking and the only thing that seemed better than rg was chunkhound, which sounds similar to this project. Actually a small Jina embedding model actually did better than voyage AI, but took a long time to
7.
by bustermellotron 4mo ago
Size of a finite set. It’s common notation in this field.
8.
by bustermellotron 5mo ago
The grid of squares actually gets > Cn for any C. (More in fact… C can grow like n^a/loglog(n).) The AI proved > n^{1 + b} for some small b > 0, which a human (Will Sawin) has now proved can be about b = 0.014. The grid can be
9.
by bustermellotron 5mo ago
You could use air scrubbers https://en.wikipedia.org/wiki/Soda_lime
10.
by bustermellotron 5mo ago
I saw Tim Gowers give a talk at the AMS-MAA joint meeting in Seattle about ten years ago where he predicted that in 100 years humans would no longer be doing research mathematics. I wonder if he’s adjusted his timeline. At the time I though
11.
by bustermellotron 5mo ago
Go go Gadget arms!
12.
by bustermellotron 8mo ago
I found it easy to adapt to the x-bows keyboard (column staggered and splayed). The thumb buttons and large ctrl, alt, space are great for emacs. My only complaint is that the braces are a bit far away.
13.
by bustermellotron 2y ago
I think the book "The Now Habit" discusses this well. (Could be another book though...) I once completed a 3000 mile cycling tour across the US (and didn't take ADHD meds while on the trip) and was I was basically disappointe
14.
by bustermellotron 3y ago
This covers most of what you need for "housekeeping" scripts in Python: https://automatetheboringstuff.com
15.
by bustermellotron 3y ago
On the other hand, your proof really only needs the binomial theorem and geometric series.
16.
by bustermellotron 3y ago
The “claim” more or less proves that k-1 th root of k is less than 2 if k is larger than 2. So I think your argument is equivalent.
17.
by bustermellotron 3y ago
Here is an elementary proof: Since m and n are distinct, we may assume that m > n >= 2. From the equation and unique factorization, we know that n divides m, so write m = nd. Then (nd)^n = n^(nd). Hence d^n = n^{n(d-1)}, which yields