For example compare how many more cities in the traveling salesman problem a super computer can solve vs your grandmas pc. It's more but surprisingly not all that many more.
What do you think of that idea?
For example compare how many more cities in the traveling salesman problem a super computer can solve vs your grandmas pc. It's more but surprisingly not all that many more.
What do you think of that idea?
Bostrom and Yudkowsky in particular seem happy to hand-wave past computational complexity.
Edit.
Moreover, if your best argument against the guy you're claiming is defrauding everyone is "I can't be bothered to read his work"...
I'm very curious: What happens if the algorithms for general artificial intelligence, and the ability for an AI to improve itself are all NP-Hard problems? Is that covered?
It might be similar to the "intelligence combustion" scenario outlined. But that appears to be a scenario where do not need to be fearing superintelligence.
You've probably read Scott Aaronson's Why Philosophers Should Care About Computational Complexity? [0]. This seems like the perfect area to apply a lot of the questions he brings up. That's what I was looking for as I skimmed through the paper. Maybe that's what idlewords was talking about as well.
We really have a poor idea of what super intelligence is - none of us can even understand people much more intelligent than ourselves.