I've written an essay criticizing the claim that computational complexity means a Singularity is impossible because of bad asymptotics: http://www.gwern.net/Complexity%20vs%20AI

Still reading minor nitpick: for point 2 you don't want to say NP (since P is in NP). It is the NP-hard problems that people would say can't be solved but for small instances (which as you point out is not a reasonable assumption).

3Luke_A_Somers4y* One screwup that you didn't touch on was the 70%. 70% is the square root of 1/2, not 2. If it's 2x as smart as its designers and the complexity class of smartness is square, then this new AI will be able to make one 40% smarter than it is, not 30% less smart. Imagine if the AI had been 9 times smarter than its designers... would its next generation have been 1/3 as smart as it started? It's completely upside-down. * Two 'Crawlviati' attributions are inside the quotes. * You didn't really call out certain objections as stronger than others. I would be surprised if giving up determinism was half as useful as giving up optimality. And changing the problem is huge. I think that, though this would not impact the actual strength of the argument, calling certain items out after the list before the next section would give it a rhetorical kick.

Open thread, Jul. 25 - Jul. 31, 2016

by MrMind 1 min read25th Jul 2016133 comments


If it's worth saying, but not worth its own post, then it goes here.

Notes for future OT posters:

1. Please add the 'open_thread' tag.

2. Check if there is an active Open Thread before posting a new one. (Immediately before; refresh the list-of-threads page before posting.)

3. Open Threads should start on Monday, and end on Sunday.

4. Unflag the two options "Notify me of new top level comments on this article" and "