I don’t really see why solving these kinds of difficult problems is relevant. A system could still recursively self-improve to solve a vast number of easier problems. That being said, I’d probably still be interested in anything relating complexity classes to intelligence.
A system could still recursively self-improve to solve a vast number of easier problems.
Well, the point here is that it looks like the problems involved with recursive self-improvement themselves fall into the difficult classes. For example, designing circuitboards involves a version of the traveling salesman problem which is NP-complete. Similarly, memory management and design involves graph coloring which is also NP complete.
I don’t really see why solving these kinds of difficult problems is relevant. A system could still recursively self-improve to solve a vast number of easier problems. That being said, I’d probably still be interested in anything relating complexity classes to intelligence.
Well, the point here is that it looks like the problems involved with recursive self-improvement themselves fall into the difficult classes. For example, designing circuitboards involves a version of the traveling salesman problem which is NP-complete. Similarly, memory management and design involves graph coloring which is also NP complete.