Having problems with message search?
Hi Haskell,
Well, there are several mathematical problems proved to be impossible, such as squaring the circle, doubling the cube and trisecting an angle. These are all very Google-able if you need more details.
Probably more what you're after, if I understand your question, is Turing's Halting Problem, which goes to the heart of such questions. Again, very Google-able.
Hope this helps.
Tim
From: H A S K E L L <haskellboy@...>
To: UnsolvedProblems@yahoogroups.com
Sent: Tuesday, November 18, 2008 11:22:18 AM
Subject: [UnsolvedProblems] Problems that are proven to have no solution
Hi there,
I am trying to find a problem that has been proven to have no solution
and I need some help. I know that is the class of problems called to
be undecidable but that only implies that this problem has a yes or no
question. Is there anything like an insolubility class ? that implies
that the question has no answer regard the answer, not that it is
still to be solved but was proven that cannot be solved ?
Offline 
Send Email