Comment Re:Light on details (Score 1) 332
I suspect that proving code is safe using static analysis is probably NP-complete.
I believe it's undecidable. Rice's theorem.
I suspect that proving code is safe using static analysis is probably NP-complete.
I believe it's undecidable. Rice's theorem.
That
Ah. This explains a lot.
What you need to examine for something like this is how it compares between people that went to these schools and people that could have, but didn't. Those who had the grades and test scores, maybe even applied, but elected to go to a state school instead. My bet? Not much difference.
FYI, they did do this, and came to the same conclusion you did.
In 1999, economists from Princeton and the Andrew W. Mellon Foundation looked at some of the same data Eide and his colleagues had used, but crunched them in a different way: They compared students at more selective colleges to others of "seemingly comparable ability," based on their SAT scores and class rank, who had attended less selective schools, either by choice or because a top college rejected them. The earnings of graduates in the two groups were about the same — perhaps shifting the ledger in favor of the less expensive, less prestigious route.
Well, TFS did say something about the driver heading onto a "busy intersection". It wasn't just one guy's life versus his and his children's.
I know, I know, trolley problem and all that, but it wasn't as simple as you make it out to be.
but the output is algorithmic with a bit of randomness thrown in.
And who's to say that's not what creativity is?
So you think that money is the root of all evil. Have you ever asked what is the root of money? -- Ayn Rand