ASipos

8 ms·

1.
by ASipos 8y ago
Also see: https://lodev.org/cgtutor/fire.html which is part of: https://lodev.org/cgtutor/
2.
by ASipos 8y ago
Crãciun fericit!
3.
by ASipos 8y ago
That's quite unexpected. Thanks.
4.
by ASipos 8y 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?
5.
by ASipos 8y 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, sche
6.
by ASipos 8y 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.
7.
by ASipos 8y ago
Don't forget Google X (the original one)!
8.
by ASipos 8y 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").
9.
by ASipos 8y ago
Yes, if you want to depict the relationships between four sets.
10.
by ASipos 8y ago
"an embedded Forth with a Lisp in C" :) Sounds like the opposite of what the post is advocating.
11.
by ASipos 8y ago
I also interpreted it the 'wrong' way.
12.
by ASipos 8y ago
The "men's" championship is actually open to everyone.
13.
by ASipos 8y ago
I hoped some source code would surface.
14.
by ASipos 8y 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 ord
15.
by ASipos 8y ago
If K-A-T doesn't spell 'cat', what does it spell?
16.
by ASipos 8y ago
This is old news. Also, slightly misleading, since it suggests to those that know the old news that MS has released later DOS source code, i.e. 6.22.
17.
by ASipos 8y ago
This reminds me of how disappointed I was in my adolescence by how all airports look the same. Only much later I realized that almost any kind of building has a common design and relies on familiarity and expectations in its potential inhab
18.
by ASipos 8y ago
I would like to see a mature language using fexprs. They are what I first thought about when I heard the word homoiconicity. Macros seem inelegant in comparison (since there is a separate layer of code that operates on code, and also you do
19.
by ASipos 8y ago
First read this as "the race to explain that time was personal".
20.
by ASipos 8y ago
The double negation translation: https://en.wikipedia.org/wiki/Double-negation_translation
21.
by ASipos 8y ago
Also, Scott Alexander on Red Plenty: http://slatestarcodex.com/2014/09/24/book-review-red-plenty/
22.
by ASipos 8y ago
I didn't know she was a woman the first time I read the first three books. Granted, this changed quickly.
23.
by ASipos 8y ago
My thoughts exactly.
24.
by ASipos 8y ago
I first thought of the Japanese custom of naming time periods after Emperors.
25.
by ASipos 8y ago
I find it weird that this was published in 2007 but the first sentence is "Some months ago newspapers all around the world considered Google’s plan to go public", and that happened in 2004.
26.
by ASipos 8y ago
Thanks! For those interested, the link is https://groups.google.com/forum/m/#!topic/superpermutators/j...
27.
by ASipos 8y ago
Come on, this is a myth. I work in math and it is not at all unusual to cite informal sources. Also, someone should inform Greg Egan: http://www.gregegan.net/SCIENCE/Superpermutations/Superpermu...
28.
by ASipos 8y ago
Neither lambda calculus, nor Turing machines "model computation on" recursive functions. Rather, these two, and all the other models of computation are equivalent as they compute the same class of functions from the naturals to th
29.
by ASipos 8y ago
> a field as esoteric as “recursive function theory” How can this kind of descriptions persist when recursive functions are the very thing that a computer computes.
30.
by ASipos 8y ago
I wasn't referring to the finiteness of the simulation, but rather to the fact that the notion of necessary truth (the box operator) is replaced by high probability. (I'm specifically referring to the modern modal versions of the

More ›