In the "Scholarpedia article on AGI published," thread I wrote:
I have been working on a novel way to represent 3-SAT problems and for
the past few weeks I have been trying to see how it was in np but I
just could not find it. Then this morning I woke up and started
thinking...(uh...) By the afternoon I finally was able to show that my
novel method of representing the problem produced a sequence of
factors that had an unusual growth function which were worse than an
exponential function.

I don't understand what goes wrong with my brain sometimes because the
function is not worse than an exponential function. My mind just slips
once in a while when I am dealing with too many variables (formally
declared and implicit) and I am trying too many variations at once. So
I cannot find that my function is outside of p. The sequence is
something like n^4 but I am not sure off hand. The SAT algorithm I am
working on looks like it is n^20 or worse right now but I can only
make an intuitive guess.

I also said that I was going to submit the sequence to the Online
Encyclopedia of Integer Sequences but now I am going to wait so I can
try to discover how complex my SAT algorithm is and make sure that it
actually works. If it is n^20 I won't be able to test it very
thoroughly but there are a lot of potential efficiencies.
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

Reply via email to