I am working on a new version of a 3-SAT solver and I am starting to see the problem in a different way then I have seen it before. It has some similarities to a multiplication algorithm that I worked on 30 years ago. I can't tell if the Fast Fourier Transform would be useful or not but it looks like a variation on the FFT might be interesting. If I can intuitively understand how the FFT works then I might be able to use it on the solver that I am currently working on. I was never able to get the multiplication algorithm that I was working on 30 years ago to work the way I wanted it to but I always felt that there was just one method missing. I tried some basic symmetry and that went nowhere but perhaps it was an asymmetric symmetry. Even though that sounds like an absurdity it isn't totally inane. As most of you know symmetry can be combined with other effective compressions to produce non-symmetric multiplicities which are strongly related on the initial symmetry of the algorithm.
This is related to Successive Over Generalization-Under Generalization Iterations and so it might have some uses in AGI. Jim Bromer ------------------------------------------- AGI Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/21088071-f452e424 Modify Your Subscription: https://www.listbox.com/member/?member_id=21088071&id_secret=21088071-58d57657 Powered by Listbox: http://www.listbox.com
