My logic paper was rejected for AGI'12 -- seems that Ben has given it a -1 score, I recognized his writing -- but never mind, I could use another year to improve it...
Time is running short, but I'm still stuck...
My compositional logic may not be the best, but assume that we accept it as the substrate, then AGI boils down to machine learning, and the algorithm for machine learning is already known, so it also boils down to optimization (speedup). Alas, speeding up logic inference (and thus machine learning) is a very hard and complex problem... (it's a combinatorial problem which we want to speed up, whereas the usual combinatorial optimization problem is just to find a maximum value).
These days I'm looking into:
1. The matrix technique -- I understand it better now, but it leaves us with a lot of points in high-dimensional space, and they require special techniques for indexing and querying (such as R-tree). I'm looking for easier alternatives.
2. Automata. My logic is almost like a regular language, except with variables. I'm wondering if I can translate logic formulas into automata, merge them into 1 big automaton, and perform inference using that? People should have tried something like this already, no? Anyway, this seems to me most promising right now...
3. Genetic programming for speed up -- I considered it briefly, but seems that the problem's complexity is too high, and GP wouldn't be able to solve it unless we constrain the problem with additional structure.
On the maths side, I'd like to learn more about the following, but may not have the time:
1. Rings and modules. If my logic is a semi-ring, then module theory may be relevant to it?
2. I still don't know what is homology and cohomology in topology. Just curious...
KY