News for hackers. Stuff that matters.

kannmig

Re:Restarts in Common Lisp on Wednesday April 01, 2020 @09:53AM (#22748458)
The material handled in PAIP mostly focuses on classical symbolic AI, as opposed to the modern ML-based AI that you refer to in RNNs.

(Not to discourage you from reading the book, of course!)

Re:Lisp: Good News, Bad News, How to Win Big (1991) on Sunday March 15, 2020 @11:40PM (#22589635)
No, Clozure is correct. OP is referring to Clozure CL, not Rich Hickey's Clojure.
Re:How Google Code Search Worked (2012) on Wednesday March 11, 2020 @10:40PM (#22553109)
Re:Google Open Source Code Search on Wednesday March 11, 2020 @08:51PM (#22552406)
Seems like this is based on Google's own internal code search tooling, something most engineers at Google rely on for every day code-level work. I personally can't even begin to imagine how I'd navigate the gigantic codebase without it.

(I work at Google)

Re:Quadsort: a stable non-recursive merge sort on Friday February 14, 2020 @01:40AM (#22324453)
I think OP made the distinction intentional to “show their working”, so to speak.
> A former colleague of mine had a teddy bear on his desk, before you could ask for his advice you had to take the teddy and explain your problem out loud to it.

https://en.m.wikipedia.org/wiki/Rubber_duck_debugging

Re:Some Lisp books (2012) on Tuesday January 15, 2019 @09:21PM (#18917765)
Steve Losh's post on how to learn Common Lisp is an amazing resource. I encourage people to check it out!

It happens to include many of the books mentioned in the parent post.

Link: http://stevelosh.com/blog/2018/08/a-road-to-common-lisp/

Accompanying HN discussion: https://news.ycombinator.com/item?id=17852194

Re:How long is that Bézier? on Sunday December 30, 2018 @02:54AM (#18788010)
For those unfamiliar with the term 'nerd sniping' (as was I): https://xkcd.com/356/
Re:Please do not attempt to simplify this code on Thursday December 27, 2018 @08:39PM (#18774245)
Reminds me of the classic SICP quip:

"Programs must be written for people to read, and only incidentally for machines to execute."

Re:The Why of Y (2001) [pdf] on Sunday December 09, 2018 @06:25AM (#18640368)
Another great exposition on the applicative-order Y combinator can be found at the end of Chapter 9 of The Little Schemer.

It is interesting to contrast with how in Haskell, one can simply define Y as

  Y f = f (Y f)
owing to the fact that it is lazily evaluated.
Re:A military technique for falling asleep in two minutes on Tuesday September 04, 2018 @12:41AM (#17906701)
I personally first learned about the described technique at https://www.artofmanliness.com/articles/fall-asleep-fast/, where the material seems to be better presented. Hope more people can benefit.