Not constructive proof of existing of an algorithm

Do you know a not constructive proof of existing of an algorithm ( polynomial time algorithm , ...).

Mayby every proof of existing of an algorithm have to give information how write this algorithm.

I.B.


--
Using Opera's revolutionary e-mail client: http://www.opera.com/m2/
.

Relevant Pages

  • Re: Computability in principle
    ... > algorithm, not a constructive proof. ... ``Given a formal specification of a problem depending on some ... computing solution y. ...
    (comp.lang.lisp)
  • Re: Python from Wise Guys Viewpoint
    ... > if a putative input/output pair is indeed correct. ... I can render any specification ... a formal system in which the correctness of the fastest algorithm can be ... a constructive proof that P=NP is decidable would be ...
    (comp.lang.lisp)
  • Re: ZFC
    ... there is a long running tradition that constructive proof = ... > constructive proof of an AE-statement yields an algorithm, ... wasting my CPU time. ...
    (comp.theory)
  • Re: Computability in principle
    ... >> algorithm, not a constructive proof. ... > ``Given a formal specification of a problem depending on some ... the fastest algorithm computing a solution* ... ...
    (comp.lang.lisp)
  • Re: symplectic group generators
    ... > is given an arbitrary symplectic matrix, an algorithm to express it in ... This topic should be included in any basic publication on Siegel modular ...
    (sci.math.research)