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…
He posted about using ChatGPT to transcribe PDFs when it first became popular. So he’s been enthusiastic about LLMs for a while.
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.
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…
Size of a finite set. It’s common notation in this field.
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…
You could use air scrubbers https://en.wikipedia.org/wiki/Soda_lime
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.
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…
This covers most of what you need for "housekeeping" scripts in Python: https://automatetheboringstuff.com
On the other hand, your proof really only needs the binomial theorem and geometric series.
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.
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…
He posted about using ChatGPT to transcribe PDFs when it first became popular. So he’s been enthusiastic about LLMs for a while.
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.
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…
Size of a finite set. It’s common notation in this field.
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…
You could use air scrubbers https://en.wikipedia.org/wiki/Soda_lime
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.
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…
This covers most of what you need for "housekeeping" scripts in Python: https://automatetheboringstuff.com
On the other hand, your proof really only needs the binomial theorem and geometric series.
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.