What I learned from Class Viewer
in [Java Programming]
|
From: Daniele Futtorovic on 20 Jul 2008 22:41 On 2008-07-20 22:53 +0100, Joshua Cranmer allegedly wrote: > ... > > Anyone else sensing a repeat of "Java and software piracy" or "Great SWT > program"? Here!
From: Andrew Thompson on 21 Jul 2008 00:35 On Jul 21, 12:41 pm, Daniele Futtorovic <da.futt.n...(a)laposte.invalid> wrote: > On 2008-07-20 22:53 +0100, Joshua Cranmer allegedly wrote: > > ... > > Anyone else sensing a repeat of "Java and software piracy" or "Great SWT > > program"? > > Here! Whoa up! It's early stages yet. "Great SWT program" The 'ever inaccurate' GG is showing 5277 posts on that thread. Impressive, though I find that figure hard to believe. "Java and software piracy" got a 'mere' 281 posts, according to GG. This thread (23 posts) has a long way to go before it reaches those epic proportions, but I suspect the OP has it in him (based on the first post, but especially from links mentioned by others). ..Good luck, everyone! For those who would prefer to shut down this thread, I suggest you state that the OP is entirely correct, everybody else is wrong and being nasty to the OP, and the OP deserves a ..Nobel prize, or a prize in Mathematics, or a pony or something for all his trolling (..errr wait) *efforts.* -- Andrew T.
From: Mike Schilling on 21 Jul 2008 01:31 Andrew Thompson wrote: > "Great SWT program" > > The 'ever inaccurate' GG is showing 5277 posts on that > thread. Impressive, though I find that figure hard to > believe. If anything, that's an underestimate.
From: Tim Smith on 21 Jul 2008 02:06 In article <wqSgk.142$GI.19(a)trnddc05>, Joshua Cranmer <Pidgeot18(a)verizon.invalid> wrote: > In short, if you want to redeem yourself, all you have to do is the > following: > 1. Stop screaming and complaining that the world is against you. > 2. Show a step-by-step example of how the algorithm works for a 5- or 6- > node problem (at least) in a clear manner, referring to diagrams for > extra clarity. Use only the information provided in the standard > NP-complete (or NP-hard, if you choose) version of the problem. Note that it would be acceptable to use additional information, if he provides a way to generate that information for an arbitrary instance of TSP. For example, if his algorithm for some reason finds it necessary to have a "distance" parameter between any pair of nodes, that obeys the triangle inequality, it would be acceptable for his algorithm to include a preliminary step of assigning each node a random location on a sphere, and assigning the "distance" between two nodes to be the straight line distance in Euclidean 3 space. .... > And here I do not forgive you for not knowing my qualities (well, I do, > but that's another story). If you look through my record of postings in > sci.math and c.l.j.p, you'll find that I have far from tried to demonize > you but instead tried to help you along. And outside of the record of > newsgroups, you'll find that it is in my nature to always give someone > the benefit of the doubt and try to work along to a solution to a degree > beyond which many have given up. It is my nature to always care. Well, you'd better be nice to him, or he might unleash The Hammer. Then we'd all be sorry. For those not familiar with The Hammer: I have my prime counting function and the paper Advanced Polynomial Factorization and those are my minor results, small enough that enough people can understand them to break through the barriers I face. But I have two bigger results, and one is The Hammer. The Hammer is coming, and when I finally fully unleash it, then the establishment will come down. And some of you seem to have thought that it mattered that you seemed to win for so long, as you thought I was gone, beaten, put down and defeated, until that paper showed up in the Southwest Journal of Pure and Applied Mathematics. But you see, few of you were smart enough to understand that time is on my side. Time is on my side. > <http://groups.google.com/group/sci.math/browse_frm/thread/c82e9e02131abc9a/7821f4e85656b58d?hl=en� f4e85656b58d> <http://groups.google.com/group/sci.math/browse_frm/thread/c82e9e02131abc 9a/7821f4e85656b58d?hl=en� f4e85656b58d> I wonder if P=NP is The Hammer? -- --Tim Smith
From: rossum on 21 Jul 2008 08:10
On Sun, 20 Jul 2008 13:04:53 -0700 (PDT), JSH <jstevh(a)gmail.com> wrote: >On Jul 20, 12:46�pm, rossum <rossu...(a)coldmail.com> wrote: >> On Sun, 20 Jul 2008 10:55:43 -0700 (PDT), JSH <jst...(a)gmail.com> >> wrote: >> >> >On Jul 20, 4:12�am, rossum <rossu...(a)coldmail.com> wrote: >> >> On Sat, 19 Jul 2008 18:04:52 -0700 (PDT), JSH <jst...(a)gmail.com> >> >> wrote: >> >> >> >Like look at my Traveling Salesman Problem solution. >> >> >> How can it be a solution if there are instances of the TSP which it >> >> cannot solve? �At best you have a partial solution. >> >> >You can always get distances between every node to the other by just >> >putting the nodes on a two-dimensional plane and saying one of the >> >weights is a distance measure. >> >> Not so. �If the nodes can be plotted on a 2D plane then you are >> solving the Euclidian TSP. �Not all instances of the general TSP are >> Euclidian TSP. �For example distances on a sphere may not be plottable >> on a 2D plane. �The instance may not even be metric. �For example, the > >My algorithm calls for straight line distance between nodes. > >Even on a sphere, there is a straight line distance even if it goes >through the sphere as the algorithm doesn't care. It just wants the >straight line distance between the nodes without regard to the surface >or whether you can actually go that path. If the straight line >distance goes through the middle of the earth, that's what the >algorithm wants. > >There are details about the algorithm which are there for a reason. > >Deliberately ignoring things like a line between two points is just a >waste of time. Thankyou for that James. Your algorithm is looking at a 3D Euclidian version of the TSP. It would reduce confusion if you referred to your algorithm as a proposed solution to the "3D Euclidian TSP", that way people will accept that you are talking about distances rather than weights on a graph edge. The 3D Euclidian TSP is still NP-hard, so a solution to the 3DE-TSP will hve the same impact as a solution to the more general TSP. [snip] rossum |