No this problem still has an answer that "there is no general
solution" the kind of problem I am looking would be more like "about
the proof that cannot be proved if there is or there is not a solution
to a quintic or higher polynomial with real coefficients" (just one
example of a problem that I am looking for). The answer would be more
to the uncertainty side where it is proven that no answer exist.

--- In UnsolvedProblems@yahoogroups.com, "Warren" <matemath@...>
wrote:
>
> Greetings ... not sure what kind of problems you seek but what about
> the proof that there is no general solution to a quintic (or higher)
> polynomial with real coefficients? It is proved that there is no
> solution in general form as exists for the quadratic, cubic and
> quartic. Would this fit the bill?
>
> Warren
>
> > Hi Tim,
> >
> > Let me explain myself, all those problems have answer, for example
> the Turing Halting is proved to not exist a Turing machine capable
of
> saying if another Turing machine will halt. The squaring the circle
> is proven to not be able to be done and etc. I am looking for a
> problem that is proven to have no answer I will give an example: I
> have a problem A that says "is Y = Z ?" and I prove that answering
> Y=Z or not(Y=Z) is impossible. so "is Y=Z?" has no answer. I am
> looking for a problem in this class.
> >
> > I am still having problems trying to understand this thinking, I
am
> still not sure if not being able to answer A is similar to not being
> able to answer "what is the Turing machines that says that another
> Turing machines halts". Maybe A is different because it would be
> closer to "I cannot prove that there is or there is no Turing
machine
> that says that another Turing machine halts". And in the problems
> pointed by you I know that or there is or there is no answer for
that.
> >
> >
> >
> > To: UnsolvedProblems@: tsr21@: Mon, 17 Nov 2008 23:43:50 -
> 0800Subject: Re: [UnsolvedProblems] Problems that are proven to have
> no solution
> >
> >
> >
> >
> >
> > 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@:
> Tuesday, November 18, 2008 11:22:18 AMSubject: [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 solutionand I need some help. I know that is the class of
problems
> called tobe undecidable but that only implies that this problem has
a
> yes or noquestion. Is there anything like an insolubility class ?
> that impliesthat the question has no answer regard the answer, not
> that it isstill to be solved but was proven that cannot be solved ?
> >
> >
> >
> >
> >
> >
> > _________________________________________________________________
> > Get more done, have more fun, and stay more connected with Windows
> Mobile®.
> > http://clk.atdmt.com/MRT/go/119642556/direct/01/
> >
>