HNHacker News
TopNewBestAskShowJobs

cchooper

380 karma · joined December 10, 2008

submissionscomments
cchooper··on My Software Is Being Pirated
I guess it's the best piracy policy precisely because it totally ignores piracy.
cchooper··on How to reduce procrastination
No, you summed it up perfectly. Psychology Today is a lifestyle magazine that just happens to have 'Psychology' in the title.
cchooper··on Krugman - Life Without Bubbles
It doesn't just look like deflation. It is deflation, which is defined as a persistent increase in the value of money. Similarly with inflation.
cchooper··on The Dumbest Interview Question
The worst question I ever got asked was: "If your friends were here, what one word would they use to describe you?"

I mean, what kind of answer are you supposed to give to that?

cchooper··on The Dumbest Interview Question
I identify my weaknessess and actively work on them, but I would never answer this question honestly, because I can't assume that the questioner is someone as enlightened as you.
cchooper··on Does Gödel Matter?
Ah, that makes a lot more sense now!
cchooper··on Does Gödel Matter?
The second theorem tells us that we can't prove the consistency of set theory without using an even more powerful system. This doesn't mean that set theory is inconsistent, it just means that we can't prove its consistency in any meaningful way. So yes, Gödel indeed shows that there are no 'ultimate axioms' that contain everything of interest in mathematics.
cchooper··on Does Gödel Matter?
To fill in some of the details: the so-called 'Second Incompleteness Theorem' states that recursively inumerable systems containing arithmetic are insufficient for proving their own consistency. It is possible to prove the consistency of arithmetic, but to do so you must use an even more complex system of axioms whose consistency can itself only be proved with an even more complex system, and so on.

So strictly speaking, the theorem doesn't rule out consistency proofs, but it does rule out proving the consistency of complex systems by simpler systems, meaning that the consistency of the consistency proofs can't be trusted any more than the consistency of the original system!

cchooper··on Functional Programming is harder than Object Oriented Programming
FP is actually more widespread than OOP, so much so that we don't even notice it (or call it FP) any more. If a language has functions, then it is somewhat functional.
cchooper··on The Seven Deadly Sins of Arc
I'd like to add a couple more points:

1. Arc isn't just immature. pg made it quite clear that it's not even finished!

2. pg has also explicitly said that he isn't interested in it becoming popular, which goes some way to explaining why it isn't.

3. pg announced some five years ago that Arc wouldn't be 'especially object-oriented' and gave his reasons why. Exactly why was this a surprise to anyone?

← PreviousPage 6 of 6