Recent submissions

Comment · 7 years ago
Comment · 7 years ago
Crãciun fericit!
Comment · 8 years ago
That's quite unexpected. Thanks.
Comment · 8 years ago
But... you have to know what a derivative is for in order to be motivated to learn how to do it. If it's all just mindless manipulation, how will one know whether to apply this or that mindless manipulation?
Comment · 8 years ago
Thanks, that page is nice, but it too emphasizes that you also need a clock. That's essential and it was the point I was trying to make. For example, a thing that is usually glossed over in OS courses (in favor of, let's say, scheduling algorithms and such) is that you simply can't make preemptive multitasking out of pure code - and later when you ask yourself how is it that such a phenomenon is possible in the first place you learn that chips are inherently parallel, that sequential code is an abstraction over that so that one can have some sort of law and order, and only then interrupts enter the scene so that one may break that order when needed, e.g. for preemption.
Comment · 8 years ago
The title of the course is misleading, as it suggests that NAND gates are the only required primitive, whereas the course later introduces DFF gates, without which you cannot escape the parallelism of chips.
Comment · 8 years ago
Don't forget Google X (the original one)!
Comment · 8 years ago
For a long time, I thought he and Joseph Campbell were the same person (as in "the mentor of Asimov, the one with the hero's journey").
Comment · 8 years ago
Yes, if you want to depict the relationships between four sets.
Comment · 8 years ago
"an embedded Forth with a Lisp in C" :)

Sounds like the opposite of what the post is advocating.

Comment · 8 years ago
I also interpreted it the 'wrong' way.
Comment · 8 years ago
The "men's" championship is actually open to everyone.
Comment · 8 years ago
I hoped some source code would surface.
Comment · 8 years ago
By "first inaccessible ordinal" you mean epsilon_0? (Probably you mean it in the sense of the first one inaccessible by addition, multiplication and exponentiation.) Because there is also a "first recursively inaccessible ordinal", which is much larger (also, not recursive: it's used to construct, by collapsing, the ordinal of Delta12-CA+BI, which is also much larger though recursive).
Comment · 8 years ago
If K-A-T doesn't spell 'cat', what does it spell?

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton