I'm a programmer and while I was working on another project, I stumbled onto an algorithm that solves the Travelling Salesman Problem (TSP) exactly in all instances.
You can read more about the problem here. https://en.wikipedia.org/wiki/Travelling_salesman_problem
My algorithm is also more efficient than any current solution.
Seeing as such an algorithm would have many applications in various fields, I was wondering what I could do to protect the algorithm and make a profit from it.
I've already looked at world wide patents and licensing, but there seems to be some areas of grey when it comes to things like computer/mathematical algorithms.
Has anyone ever patented an algorithm or knows the ins and outs of trying to patent one and licencing it out to companies?
>>8250275
you "stumbled" into an algorithm more efficient than ANY current solution?
hard to believe, what's your background?
How does one check that an algorithm solves the TSP?
>>8250289
you prove it
>>8250294
How?
>>8250275
I think you're trolling, and in case you're not, i think you've probably either only checked a couple cases only that happened to work out nicely, or you don't know how to check if your algorithm actually provides the best solution.
Like one time i thought i was on my way to proving the Collatz conjecture by using certain field extensions. Turns out i was instinctively only picking examples that worked out for me, and when i let someone else pick a starting number my theory failed miserably.
Cant you print a chip solving this algorithm accepting primenumbers above 2^64 as whole?
For example having multiple buses that themselves later does counting itselves, in describing number by one bus, counting it to have i.e. PCI-E card with this chip solving in large numerals?
>>8250297
like you prove any other algorithm works. have you read any of those? it's exactly the same
>>8250303
Or another form of interactor, for example if tegraracks are aviable as part of rack.
>>8250280
Uh, it's complicated.
Started out in the Energy sector as a programmer with a background in business and communications. Then became a High School Teacher. Then I was an author for a few years (speculative fiction). Then I joined the Navy as an Officer. After that I did some Cybersecurity/Cyberterrorism work. Finally I started my own business specializing in neurobiology and psychometrics.
I was researching working memory and neural pathways, when I came upon TSP and linked the problem to the human brain the solution just clicked into place.
Currently building a large scale simulation to make sure large TSP problems are solved by my algorithm, though I'm running out of processing power.
Just making some initial inquiries before I approach a IP lawyer and shell out the cash for patenting.
>>8250289
I run my algorithm in parallel with a brute force solution. Brute force will check every solution and come upon the best solution eventually. Then I compare them.
This is why >>8250298 makes a good point. And hence why I'm building larger simulations to make sure it works in all instances.
Though I don't have the processors to check huge TSP problems, smaller problems all seem to turn out correctly using my algorithm.
With my limited knowledge of mathematics it also seems to be logically sound, though I can't prove it.