My head of department (sorry, school), received a letter with the title "Of
Knapsacks and Travelling Salesmen" from a guy in Leeds (UK) who has clamed
to have found polynomial time algorithms for the knapsack problem and TSP.
From the style of the letter, I suspect that other universities have been
sent similar ones. The proof is, of course, faulty.
If you have seen a similar letter, please can you let me know. Maybe
someone should tell the guy that his logic is wrong, but I don't think it is
worth everyone who gets the letter sending a refutation.
David S
--
Dr David K Smith, School of Mathematical Sciences, University of Exeter,
Exeter, Devon, UK
email: [log in to unmask]
WWW: http://www.maths.ex.ac.uk/~DKSmith/HomePage.html
Glory is what God looks like when for the time being all you have to look
at Him with is a pair of eyes. (Frederick Buechner)
|