Re: This Week's Finds in Mathematical Physics (Week 226)

In article <dsirrc$pno$1@xxxxxxxxxxxx>,
baez@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx (John Baez) wrote:

In fact, the existence of a one-way function would imply that
"P does not equal NP". But, proving or disproving this claim is one
of the most profound unsolved math problems around. If you settle it,
you'll get a million dollars from the Clay Mathematics Institute:

This brings to mind a question I was wondering about. Given an NP
(-complete?) problem, is it ever possible to engineer a (partial)
differential equation, the solution of which, if known, would solve the
NP problem?

I realize this is vague. The general thought was whether a continuous
dymanical system can somehow be more computationally powerful than
something discrete.

Aaron

.

Relevant Pages

  • DISPROVING07, 2nd CfP
    ... Automated Reasoning traditionally has focused on proving ... proving, which we call disproving, particularly aims at identifying ... CADE 2005, and FLoC 2006. ... Authors of papers presented at DISPROVING and VERIFY will ...
    (comp.specification.z)
  • DISPROVING07 - DEADLINE EXTENDED to May 25, 2007
    ... Last Call for Papers ... Automated Reasoning traditionally has focused on proving ... proving, which we call disproving, particularly aims at identifying ... CADE 2005, and FLoC 2006. ...
    (comp.specification.z)
  • Re: Review of Mueckenheims book.
    ... Enderton or Suppes or whatever), it crucial to prove that the function ... By proving or disproving that it satisfies the definition of an ... Which cannot be done without knowing the domain and codomain. ...
    (sci.math)
  • DISPROVING 06 2nd Call f. Papers
    ... The opposite of proving, which we call disproving, particularly ... aims at identifying non-theorems, i.e. showing non-validity ... logics like for instance program logics. ...
    (comp.specification.z)
  • FLoC06 WS on DISPROVING Call for Papers
    ... The opposite of proving, which we call disproving, particularly ... aims at identifying non-theorems, i.e. showing non-validity ... logics like for instance program logics. ...
    (comp.specification.z)