Hacker News new | past | comments | ask | show | jobs | submit | more phoyd's comments login

Hey Bard, ever heard of Descartes?


I am not seeing an option to pass a password to the archive extractors. Is the any?


No, not yet, however the problem came up several times. Feel free to create a GitHub issue if you would like this feature.


Yes, this was awesome. They explained the VM and everything.


I remember how I read about functional programming languages for the first time in the August 1985 Byte issue, which I bought as a teenager because it featured a technical rundown of the new Amiga computer. For me in the early 80'e, Byte was a cornucopia of interesting stuff, much like Hacker News today.

(For example there was a whole issue in 1981 on Smalltalk-80, with an introduction by Adele Goldberg, where the Xerox Palo Alto people from the Smalltalk-80 team explain the implementation, the VM etc.)

https://vintageapple.org/byte/ has a (complete?) archive, albeit with slightly lower resolution scans.


Sherlock Holmes stories are almost always narrated by Watson IIRC. ChatGPT missed that too, didn't it?


Well, one could just add to the prompt: "... ah, make sure Watson is the narrator"


Every Covid self test I've ever used had two red lines for postive and one red line for negative. Why are there tests out there that need color vision?


The legal issue seems to stem from a few Sonos patents:

https://www.theverge.com/platform/amp/2021/8/13/22623977/son...

For example, Sonos has patented "Method and apparatus for adjusting volume levels in a multi-zone system" and the patent shows an app where you can set volume levels for connected devices:

https://patents.google.com/patent/US8588949B2/en



Do I miss something, or does the quick sort example fail to handle the case where the value of "fst" is present more than once in the list?


If only there was some way to formally verify that an algorithm is correctly implemented


Thanks for pointing that out! It's now fixed.


How hard would it be to prove correctness of this quicksort in an example?


Wrong. (-1/2) is 0, (-1>>1) is -1 in C/C++/Java/C#...


Wrong. -1 >> 1 produces an implementation-defined value in C.

-1/2 used to also be implementation-defined; C99 started to require truncation toward zero.

That actually makes division unsuitable for simulating bit shifting; you generally want a right shift of a negative quantity to have predictable behavior: either extend the sign, or bring in a zero. Truncating division toward zero doesn't do either; it propagates the sign, until zero is hit.

If you can, avoid signed types if you're working with bit fields.


Yeah, the signed case needs some care (and in fact has special shift operators in instruction sets).


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: