Re: My OPE & the Euclicidean TSP
JSH wrote:
On Aug 18, 8:40 am, Patricia Shanahan <p...@acm.org> wrote:
JSH wrote:
....
Simpler to me if it's all incorrect. Kind of preferable.
Good, because, although I like to keep an open mind, "it's all
incorrect" is the way to bet on proposed polynomial time algorithms for
NP-complete problems.
Sounds ok to me...
I don't mind dis-interest, but it'd kind of be nice if you
demonstrated it more, by posting less, which may sound rude, but it's
about consistency.
What disinterest? A polynomial time algorithm for an NP-complete problem
would be *very* interesting, though statistically unlikely.
I've studied mathematical fallacies since I was a teenager, and ways
software can be wrong for decades, so a not quite correct attempt at an
algorithm could also be somewhat interesting, and much more likely.
Have you ever been on a product development team from the beginning
all the way to the end? ...
Many, many times, on a wide range of project sizes, including complete
computer system developments, hardware as well as software.
Cool. I'll Google you. I'm curious now.
You won't find much, other than my newsgroup postings and a couple of
papers on ubiquitous computing. All my production programming and
computer architecture work has been as an employee of various computer
manufacturers.
You could try the US patent database. I'm the Patricia Shanahan who
lives in California. That does reflect a couple of the computer systems
I helped design, the Celerity C1200 and the Sun Fire 15K.
Patricia