HNHacker News
TopNewBestAskShowJobs

soberhoff

89 karma · joined July 24, 2016

submissionscomments
soberhoff··on New silicon structure opens the gate to quantum computers
What? How does a compiler care about the base of your machine code?
soberhoff··on Clojure 1.9 is now available
Macros are checked at compile time. So it is a static check to some extent.
soberhoff··on Why I don't support Net Neutrality
> tactic of so-called libertarians

You make it sound as if nobody could ever support libertarianism honestly.

soberhoff··on What the Industrial Revolution Tells Us about the Future of Automation
What's to stop the masses from working for each other?
soberhoff··on What the Industrial Revolution Tells Us about the Future of Automation
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 the other hand if there really is no work left to do, then everybody should be perfectly content with their material wealth.
soberhoff··on The History and Status of the P versus NP question (1992) [pdf]
Here's a much more recent and more detailed write up by Scott Aaronson:

http://www.scottaaronson.com/papers/pnp.pdf

soberhoff··on A Solution of the P versus NP Problem?
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 I don't see any reason to suspect that the paper under discussion uses non-standard techniques.
soberhoff··on A Solution of the P versus NP Problem?
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.
soberhoff··on Writing parsers like it is 2017
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 parser generator - but generally speaking it can be done.
soberhoff··on Writing parsers like it is 2017
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.
soberhoff··on A Solution of the P versus NP Problem?
What kind of esoteric logic yields proofs that require exponential time to check?
soberhoff··on Writing parsers like it is 2017
If you're generating the parser then you only really need to understand the grammar. Nothing can beat that.
soberhoff··on A Solution of the P versus NP Problem?
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.
soberhoff··on Jeff Bezos Surpasses Bill Gates as World's Richest Person
I guess his point was that it's not obviously "better".
soberhoff··on Dreaming of prime numbers in short intervals
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's no point to continue looking for a solution.
soberhoff··on Dreaming of prime numbers in short intervals
I personally prefer Cantor's diagonal argument. Especially when considering how many useful results have come from it.
soberhoff··on Lisp's mysterious tuple problem
You're saying Lisp is amazingly popular when compared to esoteric hobby and research languages? That's not a particularly high bar.
soberhoff··on Lisp's mysterious tuple problem
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 macro I'd probably have to make an alternative to `defn`. That's a great way to invent a dialect of Clojure nobody else will be familiar with.
soberhoff··on Lisp's mysterious tuple problem
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 variables are a great tool for improving code clarity. Having to wrap your logic with `(let [value (...)] ...)` in order make a new local variable is unnecessarily painful.
soberhoff··on Monte Carlo theory, methods and examples (2013)
Has any work been done on this book since 2013?
soberhoff··on MMIX 2009: A RISC computer for the third millennium (2011)
So do cars. Neither have any bearing on TAOCP.
soberhoff··on What Scientific Term or Concept Ought to be More Widely Known?
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 most things are just unpredictable?
soberhoff··on What Is Abstract Algebra? [video]
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.
soberhoff··on Ask HN: Books you read in 2016?
If you enjoyed that book I also suggest The Commanding Heights by the same author.
soberhoff··on Logical Induction
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 I might even regard it as conclusive.

soberhoff··on The Math Myth
I'd argue that the distance is 0.00000... = 0 and that distance = 0 implies that the points are equal.
soberhoff··on How to make Slack less bad for you
Doesn't disabling notifications invite the tendency to poll for updates? That would seem worse to me.
soberhoff··on What Great Listeners Actually Do
You could also just point out that the brain is finite, if you were nitpicking.
soberhoff··on 135M messages a second between processes in Java (2013)
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 that as input. Matching up specced postconditions with preconditions might work, but I'm not sure how well.
soberhoff··on 135M messages a second between processes in Java (2013)
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 spec can be leveraged to that extent.
← PreviousPage 2 of 3Next →