soberhoff

8 ms·

31.
by soberhoff 9y ago
What? How does a compiler care about the base of your machine code?
32.
by soberhoff 9y ago
Macros are checked at compile time. So it is a static check to some extent.
33.
by soberhoff 9y ago
> tactic of so-called libertarians You make it sound as if nobody could ever support libertarianism honestly.
34.
by soberhoff 9y ago
What's to stop the masses from working for each other?
35.
by soberhoff 9y ago
To me this entire argument "woe us if we run out of work to do" is directly self-contradictory. If people are miserable because they don't have the necessities of life, then, by definition, there's work left to do. On th
36.
by soberhoff 9y ago
Here's a much more recent and more detailed write up by Scott Aaronson: http://www.scottaaronson.com/papers/pnp.pdf
37.
by soberhoff 9y ago
Well, I've spent a lot of time with theorem provers as well as with normal mathematics. I've never experienced an exponential blowup when formalizing mathematical ideas. It would always boild down to step-by-step verification. And
38.
by soberhoff 9y ago
Well, I'm sure we can all agree that the mathematical paper we're discussing could be formalized into a proof that could be checked in linear time.
39.
by soberhoff 9y ago
You could theoretically put all kinds of meta-information into the grammar, even arbitrary code snippets that are pasted into the generated parser. I'm not saying that that's a good idea - it undermines much of the value of a pars
40.
by soberhoff 9y ago
I don't see how a better understanding of the generated parser helps improving those things. Either you can't improve these, or you improve these by modifying the grammar.
41.
by soberhoff 9y ago
What kind of esoteric logic yields proofs that require exponential time to check?
42.
by soberhoff 9y ago
If you're generating the parser then you only really need to understand the grammar. Nothing can beat that.
43.
by soberhoff 9y ago
Finding flaws in proofs is as easy as verifying them. After all, finding a flaw amounts to just checking a proof. Finding a proof is the truly hard challenge.
44.
by soberhoff 9y ago
I guess his point was that it's not obviously "better".
45.
by soberhoff 9y ago
I think infinities also have use in the real world. Take the insolubility of the quintic. You can reword this as saying that none of the infinitely many candidate solutions for quintics work. Its real world utility is straightforward: there
46.
by soberhoff 9y ago
I personally prefer Cantor's diagonal argument. Especially when considering how many useful results have come from it.
47.
by soberhoff 9y ago
You're saying Lisp is amazingly popular when compared to esoteric hobby and research languages? That's not a particularly high bar.
48.
by soberhoff 9y ago
I program in Clojure more than in any other language. That doesn't change the fact that I feel a stronger incentive to avoid local variables than in any other language I've used so far. Also if I wanted to tackle this issue with a
49.
by soberhoff 9y ago
I don't think it's as easy as that. In fact there's probably no single reason accountable for Lisp's lack of popularity. Here's my own personal pet peeve: Declaring local variables creates a level of nesting. Local
50.
by soberhoff 9y ago
Has any work been done on this book since 2013?
51.
by soberhoff 9y ago
So do cars. Neither have any bearing on TAOCP.
52.
by soberhoff 10y ago
I'd appreciate a more general appreciation of how little can be accurately predicted. Any time I hear sports commentators predict winners I internally shake my head. Why do so few people have the ability to admit to themselves that mos
53.
by soberhoff 10y ago
You can speed up Youtube to 2x by clicking on the settings button in the bottom right (4x sounds insane to me). And there is no chipmunk effect.
54.
by soberhoff 10y ago
If you enjoyed that book I also suggest The Commanding Heights by the same author.
55.
by soberhoff 10y ago
Douglas R. Hofstadter has written multiple books on the subject. He most directly addresses it in "Surfaces and Essences" co-written by Emmanuel Sander. It is enjoyable reading and very thorough. Pending revolutionary new insights
56.
by soberhoff 10y ago
I'd argue that the distance is 0.00000... = 0 and that distance = 0 implies that the points are equal.
57.
by soberhoff 10y ago
Doesn't disabling notifications invite the tendency to poll for updates? That would seem worse to me.
58.
by soberhoff 10y ago
You could also just point out that the brain is finite, if you were nitpicking.
59.
by soberhoff 10y ago
Completing the first half of a symbol that I've been typing already works reasonably well with Cursive. What I'm looking for is something that looks at the result of an expression and figures out what other functions can accept th
60.
by soberhoff 10y ago
I think the spec library that they're putting together right now might be able to solve the error messages. What I'm waiting for is to be able to hit something like dot in my ide and see a list of suggestions, I'm not sure if

More ›