sz

6 ms·

1.
by sz 16y ago
I wouldn't have recognized him if he had.
2.
by sz 16y ago
GHC has an API! http://www.haskell.org/haskellwiki/GHC/As_a_library
3.
by sz 16y ago
Or you could just un-check "simple passcode" in Settings...
4.
by sz 16y ago
Take the one thing a computer can do better than humans and use it as a captcha? Huh?
5.
by sz 16y ago
I was surprised to see Mathematician as #2. That contradicts everything I've read about math careers on HN.
6.
by sz 16y ago
I've proven theorems in my sleep before. It seems to be a generally accepted thing. John Cleese gave a related talk which I found very interesting: http://www.youtube.com/watch?v=zGt3-fxOvug
7.
by sz 16y ago
Hm, this might explain something. In old B&W videos people's impromptu speech seems much more eloquent than today. I wonder if the luxury of instant text communication has something to do with it.
8.
by sz 16y ago
I'm not sure actually.
9.
by sz 16y ago
Does anyone else get nauseated reading corporate speak like this?
10.
by sz 16y ago
Why are people still talking about this? It's like complaining that a Lamborghini sucks because the cupholders are hard to reach. I'm sure it would bother some people, but it's not really worth discussing, is it?
11.
by sz 16y ago
On the other hand it's hideous and you would come off as incredibly lazy.
12.
by sz 16y ago
Why not just make your own site? LinkedIn has a terrible user experience. Obviously whether foregoing a paper resume is okay depends on the company.
13.
by sz 16y ago
How long until the link expires?
14.
by sz 16y ago
Just some immediate first impressions. - The logo looks small and isolated from the rest of the page. - The text in the navigation tabs looks strange, maybe it should be centered? - The boxes with the slight shading are missing vertical bor
15.
by sz 16y ago
I was wondering what subfield coined the label $\Pi_2$, specifically. I haven't looked much into the structure of propositions and proofs per se, and I'm curious about what can be said about it.
16.
by sz 16y ago
"Since is formally a for-all/there-exists ($\Pi_2$) statement of arithmetic, there is a principle that such a proof should be convertible to one without contradiction" Where can I find more information about this sort of thing?
17.
by sz 16y ago
I was thinking about exactly this yesterday - so much of "media matter" is like junk food for the mind. I wondered if we could start an organic movement but for the content industry.
18.
by sz 16y ago
It took me a while to gain enough confidence to start thinking, "well I was ecstatic about this idea yesterday, so there must be something good here". Now I try to remember specifically what excited me. Not as a bullet point, but as a visio
19.
by sz 16y ago
haha yeah, sorry.
20.
by sz 16y ago
A good read every time. This part stood out: "In retrospect I realize that in almost everything that we worked on together, we were both amateurs. In digital physics, neural networks, even parallel computing, we never really knew what we we
21.
by sz 16y ago
Are users of #1 aware of what's going on?
22.
by sz 16y ago
Is M a function of N or fixed?
23.
by sz 16y ago
I didn't read the descriptions before, they do make it clear. I was just saying that you can't apply a technique you don't know.
24.
by sz 16y ago
(1) When I see the phrase "known techniques" in the context of math it generally refers to techniques known in the field. Novel techniques are not "known" in this sense. The different, literal, trivial interpretation of "known" makes the wo
25.
by sz 16y ago
Look at the arrows.
26.
by sz 16y ago
Are you sure? Look at the flowchart again.
27.
by sz 16y ago
I've been looking for something like this!
28.
by sz 16y ago
So the only way to solve a problem is by applying known techniques, apparently.
29.
by sz 16y ago
Fantasically written! There is a typo on the list monad example; "x <- ys" should be "x <- xs".
30.
by sz 16y ago
There ought to be a browser plugin for the paranoid... surely someone must have tried to make one?

More ›