HNHacker News
TopNewBestAskShowJobs

asboans

137 karma · joined January 20, 2022

submissionscomments
asboans··on DeepMind and OpenAI win gold at ICPC
Firstly, automobiles are really impressive.

Second, with that out the way, these cars are not playing the same game as horses… first, and quite obviously they have massive amounts of horsepower, which is kind of like giving a team of horses… many more horses. But also cars have an absolutely massive fuel capacity. Petrol is such an efficient store of chemical energy compared to hay and cars can store gallons of it.

I think if you give my horse the ability of 300 horses and fed it pure gasoline, I would be kind of embarrassed if it wasn’t able to win a horse race.

asboans··on Cursor CLI
Symlink?
asboans··on GPT-5
It would be fun to train an LLM with a knowledge cutoff of 1900 or something
asboans··on The year of peak might and magic
I keep seeing might and magic related content, despite never having played it, or even having heard of it until recently! But in the last few months I have been getting the odd YouTube recommendation, or see the occasional Reddit (and now HN) thread.

Why?

asboans··on New sphere-packing record stems from an unexpected source
Urgh you’re right. I was being dumb and am now ashamed
asboans··on New sphere-packing record stems from an unexpected source
“Fill less than 1% of its space” becomes a very counter intuitive statement in any case when discussing high dimensions. If you consider a unit n-sphere bounded by a unit cube, the fraction occupied by the sphere vanishes for high n. (Aside: Strangely, the relationship is non monotonic and is actually maximal for n=6). For n=100 the volume of the unit 100-sphere is around 10^-40 (and you certainly cannot fit a second sphere in this cube…) so its not surprising that the gains to be made in improving packing can be so large.
asboans··on Sequence and first differences together list all positive numbers exactly once
I don’t know but I think I could probably implement IsInSequenceOrFirstDifferences(n)
asboans··on A curious case of O(N^2) behavior which should be O(N) (2023)
And any operation that takes n bits as input can be trivially turned into an O(1) time and O(2^n) space algorithm through tabulation.