hcs

8 ms·

91.
by hcs 2y ago
Proofs of constant time operations include time taken to resize the table. This takes much more time (linear in the size of the table), on insertions when the table is resized, but that time is amortized over all the insertions already done
92.
by hcs 2y ago
> I just feels like it would be getting offended from a course on libraries because the course talks about how sometimes the book is checked out. If it was called "Are libraries bullshit?" it is easy to imagine defensiveness in
93.
by hcs 2y ago
Handy tip for 7-Zip, the `-mqs` command line switch (just `qs` in the Parameters field of the GUI) does this for you. https://7-zip.opensource.jp/chm/cmdline/switches/method.htm#...
94.
by hcs 2y ago
I doubt that it considers Google at all, just submit your site.
95.
by hcs 2y ago
I picked up some TutorText books recently, a programmed instructional series from the late 50s to 60s. At the end of every section there's a multiple choice question, one answer leads to the next section, the other to an explanation of
96.
by hcs 2y ago
There's just two songs in me, and I just wrote the third
97.
Perlin Noise revisited, part 4(blog.kenperlin.com)
3 points by hcs 2y ago|0 comments
98.
by hcs 2y ago
https://en.wikipedia.org/wiki/Chess_2:_The_Sequel
99.
by hcs 2y ago
fwiw, I wasn't too familiar with this usage, looked it up and sticking plaster is in the sense of bandaid here https://en.wikipedia.org/wiki/Adhesive_bandage But agreed that it's a rather tougher patch than I
100.
by hcs 2y ago
> how can it possibly compute anything other than the static inputs it's originally provided? Perhaps that's sufficient for Turing Completeness? Yes, the basic Turing machine model isn't "interactive", it takes s
101.
by hcs 2y ago
It's still a bit buggy in Nightly, it seems, over the last few days I keep triggering it on accident.
102.
by hcs 2y ago
As they say, > Build one to throw away (You will anyway) (Probably first phrased "plan" by Fred Brooks)
103.
by hcs 2y ago
I have a fun copy of Mechanized Information Storage, Retrieval And Dissemination (1968) formerly from The Free Library of Philadelphia, covered in "identification required" labels for some reason. There's also a Cinema Props
104.
by hcs 2y ago
There's a newer version of this in Last Call BBS called Chip Wizard. Much smaller grid makes for more puzzlyness.
105.
by hcs 2y ago
That was a linear driver on the moon. It's closer to The Man Who Sold The Moon, but that's also a linear driver up the side of a mountain on earth.
106.
by hcs 2y ago
I thought of Wake, too, but those seem to be related to keeping watch rather than waking someone.
107.
by hcs 2y ago
> And it bears a family relationship to the “principle of least astonishment,” which holds that if an explanation is too surprising, it’s probably not right. Huh? I thought the principle of least astonishment was a design principle, ve
108.
by hcs 2y ago
Though when it comes up in the book it's clear that it was a mistake (or a cruel joke) in that context.
109.
by hcs 2y ago
It's my understanding that par2 is designed for missing files (parts of a multi part archive), not the uniform random bit rot corruption used in that article. I think it can recover a much larger corrupted or missing block, approaching
110.
by hcs 2y ago
About one year ago was a little discussion of the much older Nimatron, maybe? https://news.ycombinator.com/item?id=36856755
111.
by hcs 2y ago
> Of course you can download your own uploads, but it's likely you have them in your local backups already as you uploaded them? Sadly many do not keep copies, so it is worth the PSA. IA is not a substitute for backups, at best it i
112.
by hcs 2y ago
It's ok, I'm electrically charged so I don't have to actually contact the article
113.
by hcs 2y ago
The IBM quip is an old saying: pick the dominant vedor because even if it's a mistake no one will blame you for it.
114.
by hcs 2y ago
Not sure why I didn't think to mention this before: One tool you might consider is redumper, it's designed in particular to handle multisession CDs, and it attempts to over-read into the disc lead-in and lead-out to catch data out
115.
by hcs 2y ago
This paper also appears in the 1989 book Studying the Novice Programmer (edited by Soloway and Spohrer). When I was looking into programming education research in the '00s this was still being suggested as a source for important expe
116.
by hcs 2y ago
Seven minute pregap on disc 1 track 4 of https://vgmdb.net/album/5549 , it's a whole long discussion between songs, with some audience cheering. VGMdb follows the "append pregap to previous track" conve
117.
by hcs 2y ago
Huffman codes are less efficient per symbol since each symbol is a bit string, arithmetic coding effectively smears symbols across bits more finely. Whether you use a dynamic or static probability model is a different issue applying to eith
118.
by hcs 2y ago
It might help to think of the sense of "proof" that's synonymous with "trial", rather than a specific formal math sense of proving a theorem from axioms by formal transformations.
119.
by hcs 2y ago
Thanks! And this is a great exercise, thanks for sharing it.
120.
by hcs 2y ago
You do need to prove that you have assigned the colors before the choice of what to reveal is made, I think. Physically this is guaranteed by the presence of the colors under the post-its (barring dynamic e-paper or something). I'm not

More ›