This gives me a new approach to the self-enhancement problem: Use OpenCog to tackle P vs NP. That is, use OpenCog tools to develop a system capable of representing and “thinking about” the problems of computational complexity theory. The models of self-enhancement that we have now, like Schmidhuber’s Godel machine, are like AIXI, they are brute-force starting points that might take forever to pick up speed. But if we design a system specifically to tackle the advanced problems of theoretical computer science, it will start out with concepts and heuristics likely to assist efficient self-enhancement, rather than having to discover all of them by itself.
This gives me a new approach to the self-enhancement problem: Use OpenCog to tackle P vs NP. That is, use OpenCog tools to develop a system capable of representing and “thinking about” the problems of computational complexity theory. The models of self-enhancement that we have now, like Schmidhuber’s Godel machine, are like AIXI, they are brute-force starting points that might take forever to pick up speed. But if we design a system specifically to tackle the advanced problems of theoretical computer science, it will start out with concepts and heuristics likely to assist efficient self-enhancement, rather than having to discover all of them by itself.