Slashdot Mirror


Physics Is (NP-)Hard

An anonymous reader writes "New research at the boundary of physics and computer science shows that determining the dynamical equations of a system from observations of its behavior is NP-hard. From the abstract: 'The behavior of any physical system is governed by its underlying dynamical equations. Much of physics is concerned with discovering these dynamical equations and understanding their consequences. In this work, we show that, remarkably, identifying the underlying dynamical equation from any amount of experimental data, however precise, is a provably computationally hard problem (it is NP-hard), both for classical and quantum mechanical systems.'"

212 comments

  1. No problem by Anonymous Coward · · Score: 5, Funny

    I am NP-smart

    1. Re:No problem by Anonymous Coward · · Score: 0

      All you need to do is figure out the eigenvalues for everything, and the rest comes easy. The entire universe is diagonal.

    2. Re:No problem by Zero__Kelvin · · Score: 5, Funny

      Not Particularly?

      --
      Guns don't kill people; Physics kills people! - John Lithgow as Dick Solomon on Third Rock From The Sun
    3. Re:No problem by masternerdguy · · Score: 1

      Fortunately making first posts isn't np hard.

      --
      To offset political mods, replace Flamebait with Insightful.
    4. Re:No problem by lightknight · · Score: 1

      As am I, but only on Saturday nights. I take the rest of the week off, as too much smartness is double plus ungood.

      --
      I am John Hurt.
    5. Re:No problem by Anonymous Coward · · Score: 0

      I am NP-smart

      Not Particularly?

      Barbie, is that you?

    6. Re:No problem by marcosdumay · · Score: 1

      On what basis do you claim the Universe is diagonal?

    7. Re:No problem by Anonymous Coward · · Score: 1

      If I knew the basis, I'd have solved the universe. (For those not up on linear algebra, the eigenvectors would form a basis for the matrix of the universe -- which is the matrix with eigenvalues as the diagonal.)

  2. Well no wonder I failed physics by the_humeister · · Score: 5, Funny

    I always thought it was hard, but that takes it to another level

  3. NP by Anonymous Coward · · Score: 2, Funny

    No Problem hard? I would have thought it would be harder...

    1. Re:NP by Samantha+Wright · · Score: 4, Informative

      In case this actually slips anyone up: NP-hard means that, given a large number of options, and an answer that is a certain combination or ordering of those items, every possible combination or ordering must be evaluated to figure out the correct answer. "NP" stands for "non-polynomial," e.g. an exponential or factorial function of the number of items used.

      --
      Bio questions? Ask me to start a Q&A journal. Computer analogies available for most topics!
    2. Re:NP by timmy.cl · · Score: 5, Informative

      Actually, NP stands for Non-deterministic Polynomial, i.e. An NP-complete problem can be solved in polynomial time in a nondeterministic Turing machine. In practice, this means that a candidate solution can be verified in polynomial time in a deterministic Turing machine (e.g. a normal computer). Normally this means the problem is exponential or factorial in a deterministic computer.
      Now, NP-hard problems are those that are *at least* as hard as NP-complete, i.e. they need not be NP, so "polynomial verification" is not required.

    3. Re:NP by Anonymous Coward · · Score: 0

      "NP" stands for "non-polynomial,"

      Actually "NP"-hard problems ARE polynomial. NP stands for non-deterministic polynomial. It is polynomial, but the grade of the polynomialis is not constant.

    4. Re:NP by Arancaytar · · Score: 1

      "NP" stands for "non-polynomial,"

      Bzzt. Non-deterministic polynomial.

      The rest is also incorrect. NP is an upper bound on difficulty, meaning that every polynomial problem is also in NP.

    5. Re:NP by rayharris · · Score: 1

      "NP" stands for "non-polynomial," e.g. an exponential or factorial function of the number of items used.

      Actually NP stands for "Non-deterministic Polynomial". See http://en.wikipedia.org/wiki/NP_(complexity).

      --
      I void warranties.
    6. Re:NP by greatslack · · Score: 1

      Slightly pedantic correction: For a problem to be in the class P means that a solution can be guaranteed to be found deterministically within polynomial time. NP-hard problems might have a deterministic polynomial-time solution for a specific instance, but it's not guaranteed for all instances. So, "NP" actually stands for non-deterministic polynomial, meaning that an answer can be verified in polynomial time, so if you get a lucky guess you could get a solution in polynomial time.

    7. Re:NP by UnknowingFool · · Score: 3, Interesting

      To paraphrase and dumb it down a bit as explained to me: this problem has no solution that will solve all cases. Every case has a unique solution that has to solved more by trial and error.

      The most common example it the traveling salesman problem. If a salesman has to drive to 5 cities, what is the best way to arrange the trip to use the least amount of fuel. Since the problem is NP hard, any solution found for 5 cities does not apply to 6, 7, . . N cities. Also any solution found applies to 5 specific cities. Changing the cities will require a new solution.

      --
      Well, there's spam egg sausage and spam, that's not got much spam in it.
    8. Re:NP by Anonymous Coward · · Score: 0

      Of course, NP-**hard** problems are by definition NOT polynomial.

    9. Re:NP by Anonymous Coward · · Score: 0

      Please stop beating the woman!!!!

    10. Re:NP by johny42 · · Score: 1

      "NP" stands for "non-polynomial,"

      Actually "NP"-hard problems ARE polynomial. NP stands for non-deterministic polynomial. It is polynomial, but the grade of the polynomialis is not constant.

      If the grade of the polynomial is not constant (ie. there is a variable in some exponent), it is no longer a polynomial.

    11. Re:NP by Anonymous Coward · · Score: 0

      Actually this is often misquoted: it should be "non-(deterministic polynomial)", ie. that there is no deterministic polynomial-time algorithm to solve it.

    12. Re:NP by Anonymous Coward · · Score: 5, Informative

      NP = can be VERIFIED in polynomial time by a deterministic TM ('normal computer')
      equivalently it can be SOLVED in polynomial time by a non deterministic TM.

      This is different than problems solved in non-polynomial time (e.g: exponential time). While it is not known if NP != P (i.e: if NP is really harder than P, as assumed), it is known that EXP > NP. So problems that require exponential time are in fact 'harder' than NP problems.

      However, it's important to notice that the article states that physics problems are NP-Hard, and not necessarily NP-Complete. The difference is vast, since an NP-Hard problem doesn't have to be in NP. It can in fact even be an undecidable problem. The halting problem is both undecidable and NP-Hard.

    13. Re:NP by RulerOf · · Score: 1

      The most common example it the traveling salesman problem.

      Every time I think I've got my head wrapped around the P/NP thing, I get an example that I sort of understand... sort of.

      Could you perhaps rephrase an example that matches nerdier things, like brute-forcing a hash or something?

      --
      Boot Windows, Linux, and ESX over the network for free.
    14. Re:NP by John.P.Jones · · Score: 1

      I would fully expect that verifying that a set of dynamical equations does indeed fit experimental evidence is in P so in this case (physics) the problem is NP-complete, certainly for classical mechanics. Verifying predictions in quantum mechanics may not be in P but is certainly in BQP.

    15. Re:NP by siride · · Score: 4, Informative

      No, we don't know that yet (that's the whole P=NP debate). The thing we do know is that they can be solved non-deterministically in polynomial time.

    16. Re:NP by siride · · Score: 1

      He explained it wrong. It's not about the constant, it's about using a non-deterministic Turing machine to solve in polynomial time.

    17. Re:NP by DigiShaman · · Score: 1

      Basically, the optimization for each itinerary requires its own formula.

      --
      Life is not for the lazy.
    18. Re:NP by Intropy · · Score: 3, Informative

      No, NP-**hard** problems are by definition no easier than the hardest problems in NP. It's an open question whether P = NP in which case all NP-hard problems that are also in NP (that intersection is known as NP-complete) are in P as well.

    19. Re:NP by Jappus · · Score: 5, Informative

      Attention: Car analogy in the last paragraph! Skip ahead, if you are bored.

      If you can prove NP != P, then yes. In that case, you can not solve an NP-hard problem in polynomial time on a deterministic Turing machine. You can still solve it on a non-deterministic Turing machine in polynomial time though. And on an Oracle-NP machine, you can even solve it in one step; as those machines have an "Oracle" that can tell you the solution of an arbitrary problem in NP in one step.

      There's a enormous zoo of complexities to sort problems into, from LOGSPACE, PSPACE, P, NP, PSPACE, NPSPACE, EXPSPACE, EXP, Oracle(P) all the way up to problems that are provably non-computable, like the Halting Problem.

      But get this: All these categories have in effect a specific machine associated with them. For example PSPACE problems are those, that can be solved on a machine that needs a polynomial amount of memory based on the input size to solve a problem. LOGSPACE is the same, but with logarithmic space. CSPACE is the same with a constant amount of space.

      Then you get to P, which does not care for space (indeed, the memory of the machine is assumed to be infinite), but it can only deterministically execute its program. If reading the symbol A in state B, it can only execute the action C -- and no other. If that machine can solve your problem in polynomial time (that is, polynomially many executions of operations with constant cost), then the problem is in P.

      NP is the same, but now your machine may execute either action C or D when in State B and reading symbol A, depending on a certain random variable (i.e. a coin-flip). If it does not need more than polynomially many of those "random" steps, then your problem is in NP.

      And now here's the nice thing: Every problem in P is also in NP. Why? Easy, because a non-deterministic machine can emulate a deterministic one; therefore, an NP-machine can trivially solve the problems a P-machine can by just following the same recipe (or emulating the P-machine).

      But here's the difficult thing: Is it possible to create a P-machine that can emulate an NP-machine while still needing only a polynomial number of steps for each step of the NP-machine. After all, remember than n^c * n^d = n^(c+d). If both c and d is constant; (c+d) is constant and this n^(c+d) is still polynomial in respect to n.

      The problem is, this reverse-question is damn hard to prove. But what you can prove is, is that there are certain problems whose solution on an NP-machine has a strange property: If you find a machine that can solve this problem on polynomial time, it can solve ALL OTHER NP-problems also in polynomial time; just by first rephrasing the desired problem to the problem it can actually solve. These problems are called NP-hard, because they are at least as hard as every other NP-problem. NP-complete problems are those whose results can be shown to be verifiable in P-time.

      Thus, if you solve any NP-hard problem on a P-machine, you have shown that all NP-problems are solvable with that machine. If you can only show that the solved problem is in NP (but not -hard), then all you've shown is that the problem is a P-problem instead.

      As always, if you want to known more, ask Wikipedia.

      If you want a car-comparison, though, maybe that will do: There are cars and airplanes. Airplanes can provably fly, drive around and transport cars; we think that cars can only drive around and transport other cars (and some small airplanes). If you can show that you can make a flying car, that can transport any airplane, you have shown that airplanes are not more than just strange looking versions of cars.

    20. Re:NP by slew · · Score: 1, Funny

      Obligitory http://xkcd.com/37/

    21. Re:NP by danm_cj · · Score: 1

      Well, NP actually stands for verifiable in polynomial time. Doesn't say anything about the time it takes to solve them. The -Hard part says that they definitely need more than polynomial time (of any degree) to solve.

    22. Re:NP by Samantha+Wright · · Score: 3, Insightful

      Congratulations, you're the first respondent to not correct "non-polynomial" as "non-deterministic polynomial." (Personally I blame lazy professors.)

      There are lots of problems solvable by a deterministic Turing machine in polynomial time (I.e. problems known for certain to be in P) that still need unique solutions for each possibility, though. Think about searching a list: you have to go through every item until you find the right one; there's no way to do it that's easier. The point about the traveling salesman problem and other classic NP-hard (and their best friends, NP-complete) challenges is that you are working with finding combinations of items, and you must check all possible combinations; there is no easier way. We haven't proven that there's no easier way (and not due to lack of trying, mind you), but there aren't a lot of people who seriously believe we'll find one.

      --
      Bio questions? Ask me to start a Q&A journal. Computer analogies available for most topics!
    23. Re:NP by Jappus · · Score: 3, Informative

      Minor correction due to it being far too late over here for perfectly clear thinking:

      NP-complete is actually a problem that solves all NP-problems (including NP-hard) and can be shown to be itself in NP. NP-hard removes the latter restriction, as any machine that can solve problems "harder than NP-complete" can trivially solve all NP-problems. So NP-hard encompasses more problems and is thus the broader category of problems. Please keep that in mind when reading my above posting, as its points are still correct, but showing P = NP-hard is much, much, much more difficult than showing P = NP-complete.

      Of course, any single NP-hard problem might actually be "merely" an NP-complete one, in case we have just not yet found an algo that can execute it in NP-time.

    24. Re:NP by slew · · Score: 1

      pedantic squared:

      What you are describing are problems that are the intersection of NP-complete (NP problems whose solution can be verfied in polynomial time) and NP-hard (NP problems that are at least as hard as the hardest problem in NP).

      AFAIK It is unknown at this time if all NP problems that are not also in "P" are NP-complete or if in the set of NP problems, there are some that are "simpler" than NP-hard problems that are still not in "P", and there is yet a subset of those that still cannot be verified in polynomial time. I don't think anyone thinks that is likely, but AFAIK it hasn't been proven yet. If all NP problems happen to also be in "P" (NP=P), then all of NP is in P and the postulated set of problems is the null set.

    25. Re:NP by Samantha+Wright · · Score: 2

      Thanks, but it was a legitimate gaffe. My professors never spent enough time on the theory behind complexity classes, so I actually had less of an idea of what I was talking about than I thought; now I understand why there are complexity classes beyond NP-hard. And besides, who are we to deny others the satisfaction of making a sound correction? :) Live by the red ink, die by the red ink, as they say.

      --
      Bio questions? Ask me to start a Q&A journal. Computer analogies available for most topics!
    26. Re:NP by VAElynx · · Score: 1

      By this definition, any function is a polynomial because I can do a Taylor expansion of it about any point.

    27. Re:NP by zakaryah · · Score: 1

      The point of distinguishing the two complexity classes is that the required steps scale differently. In most cases the scaling is the important issue, since for fixed N, 2^N is always larger than N^x for large enough N. For most algorithms, x is small (2.373 for matrix multiplication, 1.465 or smaller for multiplication, etc.), so the difference between exponential time and polynomial time becomes significant at reasonable values of N. There's no special value of N to expand around - it's asymptotics that matter. Besides, you can't Taylor expand around a discontinuity. At all.

    28. Re:NP by Anonymous Coward · · Score: 0

      Verifying fit with experimental evidence != verification in a deterministic sense.

    29. Re:NP by Anonymous Coward · · Score: 2, Funny

      No, we don't know that yet (that's the whole P=NP debate).

      I don't know what the fuss is about: P=NP, where N=1.

    30. Re:NP by zakaryah · · Score: 1

      should have been fixed x

    31. Re:NP by nedlohs · · Score: 1

      Obviously it says no such thing, since P!=NP isn't proven.

      The -Hard part just says at least as hard as the hardest problem in NP. If P==NP then that would include determinstic polynomial time problems.

    32. Re:NP by readin · · Score: 1

      In case this actually slips anyone up: NP-hard means that, given a large number of options, and an answer that is a certain combination or ordering of those items, every possible combination or ordering must be evaluated to figure out the correct answer. "NP" stands for "non-polynomial," e.g. an exponential or factorial function of the number of items used.

      Not quite right, but close enough for government work.

      NP stands for "Non deterministically polynomial". There is a mythical machine called a "non-deterministic Turing Machine". NP refers to problem that can be solved in Polynomial time on such a machine. Compare that to P, which refers to problems that can be solved in Polynomial time on a regular Turing Machine/Computer.

      The Great Question is whether P=NP. That is, are all the NP problems also P? There is a group of problems - called NP-Complete - that we know are NP but we don't know whether they are also P, the Traveling Salesman problem being the most famous of these.

      NP-Hard means that a problem is at least as hard as the NP-Complete problems - but we're not sure whether it is actually NP or not.

      Since, using the best methods we know of, problems that are NP-Complete or NP-Hard take more than polynomial time on all real computers - "Non-Polynomial" is a workable approximation to the real meaning for most non-academic purposes.

      --
      I often don't like the choices people make, but I like the fact that people make choices. That's why I'm a conservative.
    33. Re:NP by DMUTPeregrine · · Score: 1

      One way to think of a non-deterministic computer is one with an infinite (or arbitrarily large) number of CPUs. It can explore all possible orderings at once.

      --
      Not a sentence!
    34. Re:NP by Anonymous Coward · · Score: 0

      Interesting, but I find this XKCD cartoon even more relevant than yours. YMMV.

    35. Re:NP by marcosdumay · · Score: 1

      It's polynomial time in a non-deterministic computer. But as far as we know, non-deterministic computers can't actualy exist on our Universe (a physics problem, but physics is NP-hard, so how would I know?).

      In a deterministic computer (anything that does exist), the best algorithms we know for NP-complete problems (the "easiest" of the NP-hard class) take exponential time. There is lot of optimizing one can do on them, you can get some answers faster, you can reduce the subexponential factors, but we can't really solve a NP-complete problem in less than exponential time.

      But we also don't know if there is some polynomial time answer to a NP-hard problem. Maybe there is.

    36. Re:NP by UnknowingFool · · Score: 1

      Generally we know that brute force can crack a password eventually. You only know the maximum time it will take to go through all combinations; you can't calculate how long it will take to actually guess the right password. Now if you know certain characteristics about the strength of the password (length, use of special characters), you can shorten the time it takes but the problem is still the same; you have to go through all combinations until you find the password and you can't predetermine how long it will actually take.

      --
      Well, there's spam egg sausage and spam, that's not got much spam in it.
    37. Re:NP by raddan · · Score: 1

      Also, while NP-hard problems in their full generality are computationally infeasible, many instances of these problems are easily solvable. In some cases, most of the instances you care about are tractable. E.g., WalkSAT can solve for thousands (or is it millions?) of variables in a reasonable amount of time. Other randomized techniques from AI like simulated annealing are also very fast for these kinds of problems.

    38. Re:NP by Samantha+Wright · · Score: 1

      Congratulations, you are the seventh person to issue that correction. As (currently) the latest person to catch on and complain, might I ask you: do you think there will be an eighth? How about a ninth?

      For what it's worth I personally actually have taken an introductory course in finite automata of both the deterministic and nondeterministic varieties; I just had professors who weren't very committed to precision when it came to explaining the nature of complexity classes, because they (quite rightfully) put absolutely no stock in my classmates. I think after reading all of the explanations presented and with the rest of my background knowledge I can actually take fault with yours: saying "are all the NP problems also P" is bad semantics because P is a subset of NP; the TSP is actually NP-hard, not NP-complete, unless you rephrase it as a question with a boolean answer (e.g. "Is there a circuit shorter than length x?"); and it is widely believed that we will never find a proof that P = NP, and if we do it will probably be so wildly complex and unwieldy that there will be no point, or alternatively even if we don't the whole matter will be rendered unnecessary by quantum computing.

      --
      Bio questions? Ask me to start a Q&A journal. Computer analogies available for most topics!
    39. Re:NP by mcswell · · Score: 1

      ...and also where N=0

    40. Re:NP by readin · · Score: 1

      Congratulations, you are the seventh person to issue that correction. As (currently) the latest person to catch on and complain, might I ask you: do you think there will be an eighth? How about a ninth?

      I saw the others, but thought they were unnecessarily harsh (failing to give credit for the fact that "non-polynomial" close enough for engineering), incorrect in their explanation, unclear in their explanation, or some combination of those.

      I can actually take fault with yours: saying "are all the NP problems also P" is bad semantics because P is a subset of NP; the TSP is actually NP-hard, not NP-complete, unless you rephrase it as a question with a boolean answer (e.g. "Is there a circuit shorter than length x?");

      I did phrase it as a question. The full quote was, "That is, are all the NP problems also P?" See the question mark? I'm asking if NP and P are the same, or whether P is a proper subset of NP. (We know know that the other options, NP a proper subset of P and NP and P not intersecting, aren't right).

      and it is widely believed that we will never find a proof that P = NP, and if we do it will probably be so wildly complex and unwieldy that there will be no point, or alternatively even if we don't the whole matter will be rendered unnecessary by quantum computing.

      I disagree with you on all those points. It will take a long time to find a proof one way or the other, but I think the question is pretty much still up in the air whether the prove will prove or disprove P=NP, with not many people willing to bet the house either way. As for there being "no point", the initial proof most likely will be extremely unwieldy, but over time it will be simplified and even though it may remain fairly complex there will still be some important practical problems that it solves. And I find it hard to believe quantum computing will remove computational complexity (but I have to admit I know very little about quantum computing).

      --
      I often don't like the choices people make, but I like the fact that people make choices. That's why I'm a conservative.
    41. Re:NP by Sulphur · · Score: 1

      No Problem hard? I would have thought it would be harder...

      Not Particularly.

    42. Re:NP by Sulphur · · Score: 1

      ...and also where N=0

      I think you meant P=0.

    43. Re:NP by Anonymous Coward · · Score: 0

      That is not even close to the whole debate.
      For your convenience, here's How To Show NPC, broken down in 2 easy steps (usable as soon as the dirty work of proving Cook's theorem is behind us):
      1 - prove problem is NP-hard
      2 - show that a proposed solution can be verified to be an actual solution in P-time.

      Verifying a solution is somewhat simpler than producing one, and as long as confusing the two passes for 'informative' while grandparent lingers at 2, I will be out on the porch, observing stars and contemplating the sorry state of humankind.

    44. Re:NP by Anonymous Coward · · Score: 0

      So tell us, is your nerd penis hard?

    45. Re:NP by delt0r · · Score: 1

      Simulated Annealing is many things. Fast is not one of them.

      --
      If information wants to be free, why does my internet connection cost so much?
    46. Re:NP by Anonymous Coward · · Score: 0

      Hey man, it's Non-deterministic Polynomial not non-polynomial kk?

    47. Re:NP by raddan · · Score: 1

      Faster than blind search!

    48. Re:NP by VAElynx · · Score: 1

      I agree, I think - problem is I replied to the wrong comment.
      A polynomial with a non-constant grade, i.e. one that depends on what you are processing is clearly an exponential function, x^f(x) = e^lnxf(x) and then what you say applies.

    49. Re:NP by Dabido · · Score: 1

      "NP" = "nondeterministic polynomial time." Not Non-polynomial. "P" = "polynomial time" and its problems are a subset of NP.

      --
      Sure enough, the cow costume was hanging up next to the superhero outfit and sailors uniform. (S,Spud)
    50. Re:NP by Samantha+Wright · · Score: 1

      The party: you are late to it. I hope you brought your non-perishable food bank donation.

      --
      Bio questions? Ask me to start a Q&A journal. Computer analogies available for most topics!
    51. Re:NP by Anonymous Coward · · Score: 0

      At least these explanations are people trying to help by being informative, whereas your whining just comes off as complete white noise and adds nothing to the discussion.

    52. Re:NP by Samantha+Wright · · Score: 1

      Ooh, you're really digging for something to be upset about, aren't you? Tell you what; go back to the Intel thread and we can continue discussing your education.

      --
      Bio questions? Ask me to start a Q&A journal. Computer analogies available for most topics!
  4. Me too by Anonymous Coward · · Score: 0

    I am also (NP-) hard.

  5. It's not just dynamic... by SwedishChef · · Score: 2

    It's chaotic!

    --
    No one ever had to evacuate a city because the solar panels broke!
    1. Re:It's not just dynamic... by Anonymous Coward · · Score: 0

      Chaos is as easy as it gets.
      Try to explain order and you're in a whole different ballpark.

  6. Ooopps... lots of maths but no book reading by Anonymous Coward · · Score: 0

    provably: BAD
    probably: GOOD

    1. Re:Ooopps... lots of maths but no book reading by Anonymous Coward · · Score: 1

      A mathematician, a physicist, and an engineer are brought into a large room and told to stand against one wall. On the floor of the room is a very precisely drawn grid; on the opposite side of the room are three sacks.

      The three learn that each sack contains $1 million, and that the object is for each of them to cross the room and grab a sack. The only rule is that they must cross the room in half moves only. This means that first they can walk exactly half the distance from where they stand to the sack. Then, they can again walk half the distance from where they stand to the sack, and so on.

      The mathematician stands still for a moment, then shakes his head.

      "Distance = 0 will never be true."

      And with a sigh of defeat, he turns, and walks out of the room.

      The physicist stares off into the distance, and he, too, shakes his head.

      "Time to traverse distance equals infinity."

      And with that, he sighs in defeat, turns, and walks out of the room, joining the mathematician outside. Soon, they are joined by the engineer, who walks out of the room grinning, and holding all three bags.

      "Sometimes, close enough is good enough."

      (Quoted from here: http://msdn.microsoft.com/en-us/library/bb263911(v=vs.85).aspx ...but this definitely predates Microsoft)

    2. Re:Ooopps... lots of maths but no book reading by Anonymous Coward · · Score: 0

      The version I heard was slightly different, but IMO better:
      s/sack/naked lady
      Engineer quips "soon I will be close enough for all practical purposes."

    3. Re:Ooopps... lots of maths but no book reading by Anonymous Coward · · Score: 0

      You should read more books, preferably a dictionary. "Provably" is a perfectly cromulent word, it means "It can be proven" http://www.merriam-webster.com/thesaurus/provable

    4. Re:Ooopps... lots of maths but no book reading by Tanktalus · · Score: 1

      If you average out the engineer's body's movement, you'll find that he has not, actually, traversed farther than half way to the treasure. Only a mathematician or physicist would consider the leading edge to be representative of the body, whereas an engineer would consider the centre of gravity to be representative (assume a spherical body... hey, no assumption required!), and thus there'd be no problem in reaching out to grab the treasure as long as his centre of gravity hasn't proceeded more than halfway between his previous location and the treasure. Mind you, if it's very heavy treasure, this may be more difficult.

    5. Re:Ooopps... lots of maths but no book reading by Anonymous Coward · · Score: 0

      And then the test leaders took the money and gave it to the mathematician for being correct?

  7. Another author confused about computability by Anonymous Coward · · Score: 0

    From the article: "That's bad news for physics students who hope that a machine can solve all their homework problems, but at least their future jobs in the field are safe from automation."

    Do people not understand that the tractability issues with NP-hard problems also apply to humans?

    1. Re:Another author confused about computability by Anonymous Coward · · Score: 0

      Well, except that proving that is... NP-hard.

    2. Re:Another author confused about computability by siride · · Score: 1

      It might not. In any case, NP-hard doesn't mean unsolvable, it just means inefficiently solvable. Perhaps you are thinking of undecideability?

  8. NP-HARD Mapping by joelwhitehouse · · Score: 3, Insightful

    Could we then map NP-HARD computation problems onto real world physics systems to find solutions?

    1. Re:NP-HARD Mapping by Anonymous Coward · · Score: 0

      Could we then map NP-HARD computation problems onto real world physics systems to find solutions?

      Sure. Grab a pair of shoes and start walking. Let us know when you've solved the travelling salesman problem.

    2. Re:NP-HARD Mapping by Anonymous Coward · · Score: 0

      I thought we solved the traveling salesman problem with online shopping? Now the salesman doesn't need to travel anywhere.

    3. Re:NP-HARD Mapping by Bromskloss · · Score: 1

      Grab a pair of shoes and start walking. Let us know when you've solved the travelling salesman problem.

      Found him! He's right now in Garmisch-Partenkirchen. Well, that was easy enough.

      --
      Swedish plasma phys. PhD student; MSc EE; knows maths, programming, electronics; finance interest; seeks opportunities
    4. Re:NP-HARD Mapping by Anonymous Coward · · Score: 0

      Chaos, DNA and adiabatic quantum computing would be examples of these mappings.

  9. NP-Hard by Anonymous Coward · · Score: 0

    Physics makes me NP-hard.

  10. Bring in the socio/psychologists by Urthas · · Score: 1

    They've been doing this for centuries.

  11. Ow, my brain by Walt+Sellers · · Score: 5, Funny

    It seems it is nearly NP-Hard to understand the concept of "NP-Hard". Thanks to Wikipedia I now understand that I don't fully understand this.

    I should think that turning observations into accurate equations is hampered by never knowing if you have enough of the correct observations to determine the correct equation.

  12. Meaning all theories are approximate... by gestalt_n_pepper · · Score: 1

    Nothing new there, but perhaps we might all need to be a bit less fussy about physical truths. Sometimes an equation ginned up by a GA with no underlying conceptual "theory" is good enough, and as good as it gets. Not satisfying, but probably (and probablistically) true. :)

    --
    Please do not read this sig. Thank you.
    1. Re:Meaning all theories are approximate... by codeAlDente · · Score: 2

      From the abstract, it sounds like this bit is new: "As a by-product of this work, we give complexity-theoretic answers to both the quantum and classical embedding problems, two long-standing open problems in mathematics (the classical problem, in particular, dating back over 70 years)"

      --
      He once inserted random mutations into his code, just so he could have the experience of debugging.
    2. Re:Meaning all theories are approximate... by ceoyoyo · · Score: 1

      Actually, it sounds to me like we need to be MORE suspicious of computational solutions. Humans take a bunch of shortcuts and make assumptions to derive equations from data (looking for an underlying theory is one of these) and so far they've served us well.

  13. So, back to statistics by G3ckoG33k · · Score: 1

    So, back to statistics, again.

    Where is the practical relevance, really? I think this comes as no surprising news. Engineers and scientists have used simplifications and shortcuts to model the world for millennia, and advanced statistics for decades.

  14. That's not right... by Anonymous Coward · · Score: 1

    In physics we're mostly interested in approximations and not the actual answers. And getting an approximation is much much easier... (come up with ANY yes/no rule, and start applying it everywhere---you'll be approximating *some* systems to a certain degree; and it's not hard at all).

    E.g. "anyone who floats is a witch". Simple and easy approximation.

    Now, coming up with good approximations with predictive power (e.g. relativity, quantum mechanics, etc.) that's tough... but then you got a whole gray area of stuff like string theory, that can be twisted whichever way to fit observations and predict things that even in principle can never be observed.

  15. What ISN'T NP-Hard? by VortexCortex · · Score: 3, Insightful

    Aren't all except the most basic algorithms, up to and including polynomials, NP-Hard? I know the term's meaning, but stories about proving things are NP-Hard seem sort of useless to me. The English language, for example, is NP-Hard. Has this been proven? I don't know, frankly, I don't care, but it's easy to understand that it must be considering it evolves and changes as one analyses it... Much like any quantum or physical system, or even the English themselves.

    Determining if something is NP-Hard, is... wait for it.... wait for it... NP-Hard!

    1. Re:What ISN'T NP-Hard? by Anonymous Coward · · Score: 0

      Well, for one, there's more classes than just NP hard. There's also a difference between NP-hard & NP complete (& maybe NP since it's unknown if P = NP or not). For another, all you've stated are hypothesis you believe are true & obvious. Hell, other people may even think they're likely true & fairly obvious. But until you've actually shown it mathemtically, you don't know that it's true.

      Hell, it's unknown if P = NP or not. It's widely believed that it isn't. It's really plausible that it isn't. A whole lot of of modern computational theory assumes that it isn't. And yet people are still trying to prove one way or the other & it'll be a major result either way if it ever is.

    2. Re:What ISN'T NP-Hard? by chichilalescu · · Score: 1

      the result is very useful.
      one example is that it can be used to determine some minimal characteristics of an intelligent system, if by intelligent you mean something that acts based on an inner model of its environment.
      i.e. you can't make an intelligent machine with a fixed number of "CPU cores" (unless P=NP).

      --
      new sig
    3. Re:What ISN'T NP-Hard? by AndOne · · Score: 1

      I'd love to know what you consider the most basic algorithms. There are entire classes of problems which are polynomial and are not "basic". I also think you don't understand what it even means to be NP-Hard (which is just the numerical version of being NP-Complete.) Also to show that something is NP-Hard is equivalent to showing something is NP-Complete, which means you show there is a Polynomial time reduction to another problem in the appropriate class. Seriously, how did this get modded insightful.

      Honestly, I don't think you even begin to understand complexity spaces or how they work.

      http://en.wikipedia.org/wiki/Complexity_class

      --
      I don't care what you say, all I need is my Wumpabet soup.
    4. Re:What ISN'T NP-Hard? by AndOne · · Score: 1

      Correcting myself, NP-Hard isn't just the numerical version of NP-Complete. But rather the set of problems which are at least as hard as NP. NP-Hard includes the numerical versions. Sigh.

      The numerical version of many NP-Complete decision problems are often NP-Hard.

      --
      I don't care what you say, all I need is my Wumpabet soup.
    5. Re:What ISN'T NP-Hard? by Anonymous Coward · · Score: 0

          The English language, for example, is NP-Hard. Has this been proven? I don't know, frankly, I don't care, but it's easy to understand that it must be considering it evolves and changes as one analyses it...

      That doesn't mean it's NP-hard, it just means you don't have a fixed formal language that you can call "English", so it doesn't even make sense to ask whether it's NP-hard or not. And actually, there are many polynomial-time parsing algorithms for both programming languages and human languages.

    6. Re:What ISN'T NP-Hard? by Anonymous Coward · · Score: 0

      Determining if something is NP-Hard isn't NP-Hard.

      There's a concept of reduceability. If you can express a problem in the form of an NP-Hard problem, this problem is by definition NP-Hard.

      For example, the TSP (Traveling Salesman Problem) is NP-Complete. It can be expressed as a subset sum problem, which is also NP-Complete. All that is NP-Complete is also NP-Hard. If you find something that is NP-Complete, you know it's also NP-Hard.

      What about things harder than NP-Complete? If you can solve something that is even harder than NP-Complete, then since NP-Complete is a lower-bound on NP-Hard, it must be NP-Hard as well. An example, as wikipedia will confirm, is the Halting Problem. You can literally prove the infinite regress of that problem very simply. Since an infinite regress harder than NP-Complete, the halting problem isn't NP-Complete but is NP-Hard.

      Thus, what you said is false.

    7. Re:What ISN'T NP-Hard? by John.P.Jones · · Score: 3, Informative

      Perhaps unfortunately neither factoring or discrete log are known to be NP-hard yet (fortunately) polynomial time algorithms have thus far alluded us although BQP algorthims (Shor's algorithm) have been found. Of course an NP-hard problem in BQP would be a major discovery. Also simulation of quantum mechanical systems (protein folding) is known to be in BQP, although no polynomial algorithm is known and it isn't known to be NP-hard. While its true that a great many interesting problems that apparently aren't in P but are in NP are NP-hard, but the above are examples of important problems that aren't.

    8. Re:What ISN'T NP-Hard? by Anonymous Coward · · Score: 0

      Showing something is NP-Hard is not equivalent of showing something is NP-Complete. NP-Complete is a subspace of NP-Hard.

      The Halting Problem is NP-Hard but not NP-Complete.

    9. Re:What ISN'T NP-Hard? by Daniel+Dvorkin · · Score: 1

      Determining if something is NP-Hard, is... wait for it.... wait for it... NP-Hard!

      I don't think that's true. All you have to do is show that it's equivalent to another problem already known to be NP-hard. If you can show, for example, that a solution to the Traveling Salesman Problem would also be a solution to your problem, and vice versa, that's sufficient.

      As for the value of proving it, one thing that knowing your problem is NP-hard does for you is that it tells you whether you're wasting your time trying to find a polynomial-time solution. Look, nobody knows for sure if P != NP, but that's the way to bet. If someone ever shows differently, that will be one of the great mathematical discoveries of our time, and it will change the way we address a lot of problems; in the meantime, if you know you have an NP-hard problem you can say, "There's (almost certainly) no really efficient way to solve this, so I'd better assume it's going to take a hell of a lot of processor time to get a decent numerical solution."

      "The English language, for example, is NP-Hard" is pretty much meaningless. Computational linguistics is a rapidly evolving field and a lot of aspects haven't been worked out yet, but it seems reasonable to bet that -- like most fields of study -- it contains a lot of problems in P, a few clearly in NP, and a fair number where it's hard to be sure without extensive analysis.

      --
      The correlation between ignorance of statistics and using "correlation is not causation" as an argument is close to 1.
    10. Re:What ISN'T NP-Hard? by mcswell · · Score: 1

      "Determining if something is NP-Hard, is... wait for it.... wait for it... NP-Hard!"

      Wrong.

    11. Re:What ISN'T NP-Hard? by Anonymous Coward · · Score: 0

      That doesn't make any fucking sense.
      Shame on mods for improving that post's score.

    12. Re:What ISN'T NP-Hard? by Rich0 · · Score: 1

      Also simulation of quantum mechanical systems (protein folding) is known to be in BQP...

      Aren't all problems ultimately quantum mechanical problems? If they occur in the real world, then the universe is a quantum mechanical system. If they occur only in some mathematician's brain, then that brain exists in the universe, which is a quantum mechanical system.

      Of course, as you said nobody has proved that they are NP-hard, however it does stand to reason that if you built a quantum computer with a mass of perhaps a few thousand universes that you could solve quite a few problems very quickly. Building such a computer with the materials at hand (a single universe) is an exercise left to the reader.

    13. Re:What ISN'T NP-Hard? by khallow · · Score: 1

      i.e. you can't make an intelligent machine with a fixed number of "CPU cores" (unless P=NP).

      Humans are often considered intelligent and they have a fixed number of CPU cores. It's worth noting here that NP problems can be computed with a single computer (the whole point of Turing completeness) so I don't see the number of CPU cores being in itself a measure of intelligence.

    14. Re:What ISN'T NP-Hard? by chichilalescu · · Score: 1

      First, when I say "intelligence" I'm talking about something that can generate inner models of their environment, evolve the inner models, and act based on the predictions. Note that I said "generate".
      If physics is NP hard, it means that a being moved from a smaller environment to a bigger environment has to solve an NP hard problem. In reality, a human child needs a very long time to learn how to walk, but they need less time afterwards to learn how to ride a bike. I can personally remember how much concentration I needed when I first learned how to ride a bike, but now I can do it without really thinking about it. What this means is that I "optimized the code". But the physical problem of riding the bike is still just as complicated as it was back then, so there are still considerable resources being used for that. The fact that I don't miss those resources means that, in practice, I have "a variable number of cpu cores".
      Furthermore, there was an initial effort of learning (i.e. generate the inner model). But if you look from the outside, the time needed for learning to ride the bike is smaller then the time needed to learn to walk. I think this would be different for a machine with the same fixed number of cpus allocated to each problem.

      This is just a guess, so don't worry about offending me if you can provide a better picture.

      --
      new sig
    15. Re:What ISN'T NP-Hard? by khallow · · Score: 1

      I doubt riding a bike, a tool made for its use, is a NP hard problem. Part of how we operate is by creating tools and infrastructure to simplify our interaction with the world. Second, figuring out how to ride a bike is a different and easier problem than figuring out how to ride a bike optimally. NP-hard problems often have polynomial time approximations and it appears that model building of reality is one such.

      I could build an optimal model of how to ride a bike from point A to point B. But it'd have to include special cases (for example, how to change my actions, if I develop a cramp in one leg or if the road has intermittent slick spots due to a dripping trash truck that I'm following). But I can come up with a "good enough" model and don't really gain anything from getting past that.

    16. Re:What ISN'T NP-Hard? by khallow · · Score: 1

      The fact that I don't miss those resources means that, in practice, I have "a variable number of cpu cores".

      The thing is a single core CPU should be just as capable of doing that. It might take longer to learn how to ride a bike than a massively parallel system such as the human brain (on appropriate strata), but the task isn't dependent on the number of cores a system has.

  16. No surprise by mbone · · Score: 1

    I really don't see why this is surprising. Hasn't there been a long history of failed attempts to mechanize the reduction of lots of data into hypotheses ? Don't these generally run into a combinatorial explosion of possible hypotheses, which seems like a requirement for a NP hard problem ? As the Wikipedia article says the most notable characteristic of NP-complete problems is that no fast solution to them is known, which seems to apply here,

  17. Dynamical by Anonymous Coward · · Score: 0

    Anyone else read this word and not believe it was a real word at first?

    1. Re:Dynamical by Anonymous Coward · · Score: 0

      no.

  18. So simulation models are not as good as we thought by mbeckman · · Score: 1
    "we show that, remarkably, identifying the underlying dynamical equation from any amount of experimental data, however precise, is a provably computationally hard problem"

    Hmmm... dynamical equations for systems such as CLIMATE?

  19. Re:Exceptions by dkleinsc · · Score: 2

    A particular scientific theory can be both well-proven and NP-Hard to determine. For instance, the process of determining that acceleration due to gravity is approximately 9.81 m/s^2 is NP-Hard. But that doesn't make the fact any less proven. That's because humans are smart enough to solve NP-Hard problems, and do so every day.

    In other words, you're living up to your sig.

    --
    I am officially gone from /. Long live http://www.soylentnews.com/
  20. No new news by Anonymous Coward · · Score: 0

    There were multiple studies on this. The whole "cellular automaton" / NKS and the studies preceding that, as well, in the 70s and 80s. So nothing new here.

  21. Timing is everything! by NEDHead · · Score: 1

    I'm glad I got my physics degree before they figured out how hard it is.

  22. Metaphysics by Daetrin · · Score: 1

    So now that everyone has got all the dumb jokes out of the way, this has me wondering. If this applies to both classical and quantum physics does that mean that figuring out F=ma was NP-hard? Is that in the sense that it _could_ have been a crazy equation with dozens of components? Are we lucky that nature seems to "prefer" the simple solutions? Or do the solutions appear simple because the simple things we compare them to are based on those laws? Could there be a universe in which if you chart the motion of a falling body instead of a parabolic curve you get some kind of roller coaster ride, and all the Galileos and Newtons of that universe say "what the fuck is up with that?" and then go back to farming or alchemy or whatever?

    Of course if you consider relativity it does get pretty complicated. If the speed of light was 5 m/s, so that we had to deal with relativity in our daily lives, would we ever have been able to get a start at physics as a mathematical endeavour? Or is it a "requirement" in the formation of universes or life itself that there be a range of physics in which everything behaves in a "simple" and "consistent" manner?

    --
    This Space Intentionally Left Blank
    1. Re:Metaphysics by masternerdguy · · Score: 1

      Or maybe the universe as we know it doesn't exist with such bizzare laws. There might be other universes where f=sinma or something but we couldn't live there.

      --
      To offset political mods, replace Flamebait with Insightful.
    2. Re:Metaphysics by codeAlDente · · Score: 1

      Interesting questions. Our sensory systems would be very different if light traveled slowly. The speed of light, and the ion channels in our brains that convey patterns of light, depend on the EM properties of free space. It might be like trying to swim at low Reynolds number. One treatment that I've found compelling is a mathematical approach to Occam's Razor. pdf here: www.sas.upenn.edu/~vbalasub/public-html/Inference_files/Preprint.pdf

      --
      He once inserted random mutations into his code, just so he could have the experience of debugging.
    3. Re:Metaphysics by skids · · Score: 3, Informative

      Just because something is NP hard does not make it especially hard. NP-hard problems are only necessarily hard if the number of variables involved is high.

    4. Re:Metaphysics by TheCouchPotatoFamine · · Score: 1

      they wouldn't say "what the f*** is that" if they'd seen it their whole lives. WE could be in the complex one. next question! :)

      --
      CS majors know the time/space tradeoff, but they never get taught the 3rd, crucial, tradeoff of the set: comprehension!
    5. Re:Metaphysics by Daetrin · · Score: 1

      It's certainly possible there could be universes where they have even simpler laws and figure it out even quicker than we do. However it took us a couple thousand years to figure out gravity and the laws of motion, and that's just with the "simple" laws we have. Cro-magnon men also saw and experienced gravity and motion their whole lives, so why didn't they figure out F=ma? And why do you feel that with more complex laws it wouldn't take even longer to figure out? And do you disagree that if the more complex the math involved the longer it takes to figure out, there could not be some point at which the math required just for the first step was so complex that no one would every make it past that point?

      Simply put, i knew plenty of people in high school who knew what happened when you dropped something or tripped but couldn't understand F=ma. I don't have faith in your claim that just because you've seen something happen and know what to expect from the effect in general terms means that you can also describe it and understand it mathematically.

      --
      This Space Intentionally Left Blank
    6. Re:Metaphysics by ceoyoyo · · Score: 1

      The problem is NP-hard if you just take a pile of data and try to find an equation that fits it. Fortunately Newton didn't have to do that - he assumed that the solution was simple, and knew what was actually going on behind the data. People solve NP-hard problems all the time, mostly because we cheat.

    7. Re:Metaphysics by TheCouchPotatoFamine · · Score: 1

      i'm only trotting out the anthropomorphic principle: it only looks like our laws are "average, but nicer then some, maybe harder then others" because we see it from this perspective. Because mathematics can be simplified (that is, an abstraction used to say less with more), i imagine that the other universes would have only a limited number of useful abstractions for the entire range of properties observed. I'd be willing to bet that most if not all of the changes that happened would not require new math, just a new understanding of that math. I believe that to other universes the complexity wouldn't change (here defined as, exponentially, how hard something is) but rather a limited number of abstractions would then cover them all, and if some "comparative universal astro-physicist " were studying it, see a profound symmetry in all the universes, but what the hell do I know ? ;-)

      --
      CS majors know the time/space tradeoff, but they never get taught the 3rd, crucial, tradeoff of the set: comprehension!
  23. Hmm... by tool462 · · Score: 5, Funny

    So these scientists were studying the science of physics itself, at some higher abstract level.
    Does that mean this research is metaphysics?

    1. Re:Hmm... by Anonymous Coward · · Score: 0

      Is metaphysics NP-Hard too? Let's study that... so it would be meta-meta-physics... I wonder if that is NP-Hard as well?

    2. Re: Hmm... by Anonymous Coward · · Score: 0

      Yes, I would classify this research as metaphysics. So why is this modded funny?

    3. Re: Hmm... by tool462 · · Score: 2

      It is definitely metaphysics in the academic/philosophical sense.

      However, metaphysics has come to colloquially refer to things like mysticism, spiritualism, etc.
      http://websyte.com/alan/metamul.htm

  24. "dynamical" by Anonymous Coward · · Score: 0

    "dynamical" is not a word. The word "dynamic" also does not appear in TFA. So don't use it.

  25. Found the article on arxiv by mattr · · Score: 4, Informative

    "Determining dynamical equations is hard" by Toby S Cubitt, Jens Eisert, Michael M Wolf.
    http://arxiv.org/abs/1005.0005

    An earlier article by same team:
    "The Complexity of Relating Quantum Channels to Master Equations" by Toby S. Cubitt, Jens Eisert, Michael M. Wolf
    (Submitted on 17 Aug 2009 (v1), last revised 12 Sep 2011 (this version, v2))
    http://arxiv.org/abs/0908.2128

    Here, we give complexity-theoretic solutions to both these open problems which lead to a surprising conclusion: Regardless of how much information one has gained, deducing dynamical equations is in general an intractable problem -- it is NP-hard. More precisely, the task of determining dynamical equations in general is equivalent to solving the (in)famous P versus NP problem [1]. If P != NP, as is widely believed, then there cannot exist an efcient method of deducing dynamical equations.

    On the positive side, our work leads to the rst known algorithms for extracting dynamical equations from measurement data that are guaranteed to give the correct answer. For systems with few degrees of freedom, this is immediately applicable to many current experiments. And, indeed, the primary goal of many experiments is to characterize and understand the dynamics of a system.

    1. Re:Found the article on arxiv by rayan · · Score: 1

      "Determining dynamical equations is hard" by Toby S Cubitt, Jens Eisert, Michael M Wolf.

      "The Complexity of Relating Quantum Channels to Master Equations" by Toby S. Cubitt, Jens Eisert, Michael M. Wolf

      Obviously he was born to do this. Wonder what contribution his parents made to quantum information theory, other than him...

  26. Re:So simulation models are not as good as we thou by Ambitwistor · · Score: 1

    This result says essentially nothing about the quality of simulation models, either for the climate or any other complex system. It applies to exactly reconstructing the dynamics of a system. It says nothing about the quality of approximations to dynamical systems (i.e., simulation models), or the difficulty in constructing "good" approximations (where "good" is, in general, application-dependent).

  27. durrr why is this news by Dr.+Tom · · Score: 2

    This is the kind of thing that gets published in "peer-reviewed" journals when there are only 2 reviewers who belong to the wrong field. It is an ancient result that given the output of even a finite state machine, you can't figure out which FSM is being used.
    Determining the exact diff. eqs. used to produce a given continuous system output is so obviously intractable that it's clear the "reviewers" were physicists barking out of the wrong hole.

    Can I use mod points to get an article removed entirely?

    And to the poster who said "what about F = ma?" I'd like to point out that Newton was WRONG.

    ----
    OP: O day and night, but this is wondrous strange!
    "And therefore as a stranger give it welcome.
    There are more things in heaven and earth, OP,
    Than are dreamt of in your philosophy."

    1. Re:durrr why is this news by codeAlDente · · Score: 1

      Why is it so obvious that data defined on discrete spaces should follow the same laws as data defined on continuous spaces? On one hand, it seems intuitive, even perhaps obvious. On the other hand, it has previously seemed intuitive to me that Fermat's last theorem would be proven using the mathematics of integers, but instead it came out of complex geometry.

      --
      He once inserted random mutations into his code, just so he could have the experience of debugging.
    2. Re:durrr why is this news by Dr.+Tom · · Score: 1

      Hrmm, as a matter of fact discrete systems can have chaos already in just 1 dimension while continuous systems require at least 3 dimensions. Point taken. Some physical systems (e.g. a pendulum swinging in 2D) are simple.

    3. Re:durrr why is this news by Chris+Burke · · Score: 1

      And to the poster who said "what about F = ma?" I'd like to point out that Newton was WRONG.

      I'm pretty sure he was right given the precision of the available data. :)

      The more salient part though is that he wasn't doing what the article describes, he was dealing with a specific problem he had some intuition about, and could use the time-honored technique of guess-and-check to drastically reduce the search time.

      --

      The enemies of Democracy are
    4. Re:durrr why is this news by Anonymous Coward · · Score: 0

      ...you can't figure out which FSM is being used.

      There IS only one FSM, you non-pastafarian heretic.

  28. Re:Exceptions by Curunir_wolf · · Score: 1

    A particular scientific theory can be both well-proven and NP-Hard to determine.

    Yea, but I was referring to the AGW theory, not theories that can make consistent predictions. Before you can even derive a reliable equation, you need to understand and include factors in all the underlying equations and their ultimate effects.

    Oops! Missed another one.

    --
    "Somebody has to do something. It's just incredibly pathetic it has to be us."
    --- Jerry Garcia
  29. NP Does Not Stand For Non Polynomial by Anonymous Coward · · Score: 5, Informative

    Every time complexity theory shows up on Slashdot about half the posts try to explain what P, NP, NP-Complete, and NP-Hard mean but fail horribly. I'm going to post this and hope it gets modded up, though I have my doubts.

    Quick, rudimentary definitions:
    P: Deterministic polynomial time. A problem is in P if there exists a deterministic polynomial time Turing machine that decides it.
    NP: Non-deterministic polynomial time. A problem is in NP if there exists a non-deterministic polynomial time Turing machine that decides it. Note that deterministic polynomial time Turing machines are a special case of non-deterministic polynomial time Turing machines, so every problem in P is also in NP. NP DOES NOT STAND FOR NON-POLYNOMIAL! Half the posts on this article are going to say that NP stands for non-polynomial and that only exponential time algorithms exist for problems in NP, so I want to nip it in the bud immediately. If NP stood for non-polynomial then P != NP trivially. Another way of defining NP is to say that there exists a deterministic polynomial time verifier for every problem in NP. A deterministic polynomial time verifier is an algorithm that, given an instance of a problem and some extra piece of data (usually a potential answer), can decide the problem.
    NP-Hard: A problem q is NP-Hard if there exists a polynomial time reduction from every problem in NP to q. Since reductions exist, if you found a deterministic polynomial time algorithm that solved q you would show that P = NP. Read up on Cook's theorem if you're interested in how arbitrary polynomial time reductions can be made from any problem in NP to Circuit-SAT (an NP-Complete problem).
    NP-Complete: A problem is NP-Complete if it is both NP-Hard and in NP. There exist NP-Hard problems that are not NP-Complete.

    Anyways, continue....

  30. This is oil exploration. by Anonymous Coward · · Score: 0

    We make seismic echo soundings; then attempt reconstruction of the heterogeneous medium through which the waves have propagated. It's difficult. It's fun. It's rewarding. And we get to play with exotic computing machinery.

  31. And I thought it was.. by Anonymous Coward · · Score: 0

    F-n hard

  32. Not surprising at all... by tjstork · · Score: 1

    So science is impossible? duh, at least we have a theorem that says it.

    Honestly, I'm not surprised at all... it's basically just saying that you can't figure out the nature of a machine that created a pattern of bits without having it to begin with. There are some cool implications.

    --
    This is my sig.
    1. Re:Not surprising at all... by dargaud · · Score: 1

      So science is impossible?

      Not, it merely says that it's difficult and will stay this way. If you want to prove that it's impossible you need to look in the direction of Godel's incompletude theorems...

      --
      Non-Linux Penguins ?
    2. Re:Not surprising at all... by mbone · · Score: 1

      So science is impossible? duh, at least we have a theorem that says it.

      Only if you believe our brains are congruent with Turing machines, which (adjusting flame resistant sunglasses) I do not.

  33. So, duh? by chaboud · · Score: 1

    Since Aggregability is NP-Hard, this should surprise exactly nobody (who reads papers on complexity).

    1. Re:So, duh? by codeAlDente · · Score: 1

      Thanks for the link. By my reading, it does seem that the conclusions drawn in the paper discussed here follow trivially from the claim that Aggregability is NP-hard.

      --
      He once inserted random mutations into his code, just so he could have the experience of debugging.
  34. Re:Exceptions by siride · · Score: 1

    Clearly you don't understand how science works.

  35. Re:So simulation models are not as good as we thou by mbeckman · · Score: 1
    Really? Then why did the authors say:

    "any general algorithm that turns a data set into a formula that describes the system over time can't be simplified so that it can run on a computer"

    in an upcoming issue of Physical Review Letters? Seems like simulation of complex systems like climate are NP-Hard, which cast serious doubt on the models employed by proponents of human-induced climate change.

  36. Re:Exceptions by siride · · Score: 1

    You are indeed a crackpot. Strawmen are fun, no?

  37. Schrodinger's Cat Fight? by Walt+Sellers · · Score: 1

    Does this mean that mathematicians set out to mathematically prove that their jobs are harder than physicists' jobs?

    1. Re:Schrodinger's Cat Fight? by c4tp · · Score: 3, Funny

      I would pay to see a Schrodinger's cat fight. So suspenseful!

    2. Re:Schrodinger's Cat Fight? by CaseCrash · · Score: 1

      I would pay to see a Schrodinger's cat fight. So suspenseful!

      Spoiler alert: The live one wins

      --
      No, that link you posted to a web comic we've all seen a hundred times is not "obligatory."
    3. Re:Schrodinger's Cat Fight? by Anonymous Coward · · Score: 0

      If we get to see some titties, we all win.

    4. Re:Schrodinger's Cat Fight? by Oxford_Comma_Lover · · Score: 1

      I would pay to see a Schrodinger's cat fight. So suspenseful!

      The over/under varies based on whether the cats are entangled.

      Like horse-racing.

      --
      -- IANAL, this isn't legal advice, and definitely isn't legal advice for you. Also, Squee!
    5. Re:Schrodinger's Cat Fight? by Anonymous Coward · · Score: 0

      But you'd collapse the wave function by observing it!

    6. Re:Schrodinger's Cat Fight? by Austerity+Empowers · · Score: 1

      Spoiler alert: The live one wins

      Only if you peak.

    7. Re:Schrodinger's Cat Fight? by Anonymous Coward · · Score: 0

      Cut them some slack! Their job is already undecidable and incomplete.

    8. Re:Schrodinger's Cat Fight? by TransientAlias · · Score: 1

      there is actually only one cat.

  38. Re:Exceptions by Curunir_wolf · · Score: 1

    Clearly you don't understand how science works.

    Right, because I think that it has nothing to do with popular opinion, PR, and consensus.

    --
    "Somebody has to do something. It's just incredibly pathetic it has to be us."
    --- Jerry Garcia
  39. Re:Exceptions by siride · · Score: 1

    It certainly does have to do with those things, but it also has to do with real, actual science. False dichotomy.

  40. NP Hard ain't that hard by PPH · · Score: 2

    So, what are these people up to?

    http://www.dailygalaxy.com/my_weblog/2011/05/-crunching-the-cosmos-will-intelligent-computers-trump-human-einsteins.html

    I love all the CS majors with their NP-hard, can't do that theorems. Back when I was working at Boeing, we had a system that could take plain English engineering documents, parse them into a knowledge base and generate automated system tests. It was originally written by a couple of flight controls (mechanical) engineers. Part of my job was to maintain it. Every damned CS guru that came by told us that natural language recognition was too difficult a problem to solve. Except that we had been doing it for years.

    Awaiting a CS major to jump in and start screaming at me in 3 ... 2 ... 1 ...

    --
    Have gnu, will travel.
    1. Re:NP Hard ain't that hard by epistemiclife · · Score: 1

      Well, there are a couple of issues here: First, NP-Hard refers to the worst case. To say that a problem is X-Hard or X-Complete means that the problem is not solvable in deterministic polynomial time /in general./ It does not mean that there are not solvable instances of the problem or that there aren't heuristics that can speed up the process for certain kinds. The latter, in fact, is that to which the entire field of machine learning is devoted. For example, the AI problem of planning is PSPACE-Complete, but there freely available planners that do quite well on certain instances, but they cannot be guaranteed to work for every instance in a reasonable amount of time, because the generalized problem is PSPACE-Complete. There is a possibly deeper issue here of what these equations actually represent, and how model-dependent they are, but it sounds as though you have some misconceptions about computational complexity theory.

    2. Re:NP Hard ain't that hard by neonsignal · · Score: 1

      that might just say more about the type of English used in Engineering documents than it does about the ease of parsing natural language...

      Anyway, parsing natural language is not hard in the sense of computational complexity. It is hard in the sense that natural language is imperfectly modelled, requires a lot of context, varies between speakers, and has enough complexity to often seem irregular. Even humans can misunderstand natural language, despite being particularly good at language.

    3. Re:NP Hard ain't that hard by mcswell · · Score: 1

      I worked at Boeing Computer Services during the mid-80s on syntactic parsing of English. The parser once found a sentence (I think it was from the WSJ) of about 20 words that was over 1000 ways ambiguous. That's getting towards the worst case end, although I think sentences like "Buffalo buffalo buffalo buffalo" (...) are still harder. (In case you think that's not a real sentence, let me assure you that I'm not buffaloing you...)

      Anyway, our parser was later put to work with a simplified grammar to enforce the usage of "Simplified English" grammar in aircraft manuals. The motivation was that the manuals often have to be read by non-native speakers of English, so keeping them as simple as possible is really important. And no, simplified English is not the native language of engineers.

  41. "dynamical"? by Paracelcus · · Score: 1

    "dynamical", not dynamic? I know it's a trivial observation but it tends to affect the veracity of the author.
    Is this (in your opinion) the correct verbiage? (just asking)

    --
    I killed da wabbit -Elmer Fudd
    1. Re:"dynamical"? by hazem · · Score: 1

      Books about chaos and nonlinear dynamics tend to use "dynamical". I'm not sure how it might be distinct from "dynamic".

      For example, a "classic" book, Nonlinear Dynamics and Chaos, by Strogatz has a section titled, "A Dynamical View of the World"
      Now that we have established the ideas of nonlinearity and phase space, we can present a framework for dynamics and its applications.

      So within the title and the first sentence he uses dynamical and dynamic. I don't think it was a mistake, but I'm not sure what difference there is.

  42. Re:Exceptions by Curunir_wolf · · Score: 1

    What's fun is seeing how people react when you point out the flaws in their religion. They can't even take a joke!

    --
    "Somebody has to do something. It's just incredibly pathetic it has to be us."
    --- Jerry Garcia
  43. Re:So simulation models are not as good as we thou by skids · · Score: 1

    I see no evidence that the authors used this language, rather than the journalists.

    Note that trying to apply this to large simulations, which do not actually yield formulas, but rather projections, is sophomorism on its face.

  44. Just Like Heavier-than-air by Anonymous Coward · · Score: 0

    Until next week's RnDNA / quantum / thingy cloud blade complex is spawned brainwasheting-space - in 3D. O Tempora, ...

  45. Let me try to explain by l2718 · · Score: 2

    "NP" is a class of problems; roughly it's the class of problems for which you can quickly verify whether possible solutions are correct. For example, factoring a large integer may be hard, but checking that a given factorization is correct simply requires doing some multiplications. Making a weekly schedule for a school subject to constraints (every teacher can only teach one class at a time, every classroom can only be used for one class at a time, Dorothy gets Wednesdays off ...) is hard, but checking whether a given schedule satisfies the constraints is easy.

    Now some problems are easier than others. How do we make this precise? We say that a problem A is easier than B if, given a method for solving B efficiently we can use it to solve A efficiently.

    Finally, a problem is "NP-hard" if it's "harder than any problem in NP" in the sense above. Now NP problems are believed to be generally difficult to solve [for example, the scheduling problem is believed to be difficult]. So a problem harder than all NP problems ought to be hard.

    What the paper shows is that if you had a method for efficiently reconstructing the laws of physics from experimental data, then your method also be used to solve scheduling problems, factoring, and all other NP problems.

  46. Re:So simulation models are not as good as we thou by Anonymous Coward · · Score: 0

    Except simulation is the inverse problem. Simulation is going from a model to a represenative data set, this is about going from a data set to model. This no more casts doubt on climate simulation than factoring being NP-hard casts doubt on computer's multiplying integers.

  47. Re:Exceptions by siride · · Score: 1

    It's not a religion, well, except for the deniers, who will go to any length to stick their heads in the sand and distort, attack and otherwise misrepresent the complexity of the situation and the scientific findings thus far. It wasn't even a political issue until a bunch of conservitards decided that they didn't like the idea of giving up their precious oil-based lifestyle.

  48. Re:So simulation models are not as good as we thou by mbeckman · · Score: 1
    Kate McAlpine, who wrote the story for Science Magazine, specifically says this is a statement from the team that wrote the paper:

    Mathematicians recognize a set of truly hard problems that can't be simplified, Cubitt explains. They also know that these problems are all variations of one another. By showing that the challenge of turning physics data into equations is actually one of those problems in disguise, the team showed this task is also truly hard. As a result, any general algorithm that turns a data set into a formula that describes the system over time can't be simplified so that it can run on a computer, the team reports in an upcoming issue of Physical Review Letters.

    Strawman alert: Nobody has said simulations yield formulas. They use descriptive formulas, which are derived from empirical data such as weather statistics (temperature, humidity, air flow, etc). The whole point of the article is that such equations, upon which climate simulations do indeed depend, are not easily derived and may not be reliable in many cases. Thus the projections produced by simulations are not as reliable as we thought. Hardly sophomoric. GIGO

  49. Re:Exceptions by JWW · · Score: 1

    You are completely right. Things like gravity are well proven and yet we still don't know its true nature.

    But, I'd wager that climate science still fits in the realm of NP-Hard and not well proven.

    There is a lot of model work to be done before we call climate science well proven, heck I still think there are a lot of variables and feedback mechanisms that will need to be heavily studied and solved before we can even start on the well proven trail.

    Don't get me wrong, I'm not saying global warming doesn't exist. I'm just defending the guy who was making a joke about "the science being settled" (no one should ever really say that).

  50. NP-Hard or not even computable? by sugarmotor · · Score: 2

    Marian B. Pour-El found that even linear systems can have non-computable properties. See "The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable", Marian B. Pour-El, Ning Zhong, example link, http://onlinelibrary.wiley.com/doi/10.1002/malq.19970430406/abstract

    Obviously there's a huge gap between NP-hard and non-computable.

    On the other hand, one cannot even take it for granted that the Halting problem is not decidable. Toby Cubitt and colleagues probably assume a certain amount of metaphysics. I imagine they only claim NP-hardness as opposed to NP-completeness because they have no NP algorithm to show?

    S

    --
    http://stephan.sugarmotor.org
  51. Not surprising by larsbars · · Score: 1

    given this:

    Unpredictability and undecidability in dynamical systems

    Abstract: "We show that motion with as few as three degrees of freedom (for instance, a particle moving in a three-dimensional potential) can be equivalent to a Turing machine, and so be capable of universal computation. Such systems possess a type of unpredictability qualitatively stronger than that which has been previously discussed in the study of low-dimensional chaos: Even if the initial conditions are known exactly, virtually any question about their long-term dynamics is undecidable."

  52. Limits of physics by minstrelmike · · Score: 1

    Most scientists assume without much thought that physics has no limits.

    However, even a tiny bit of analysis shows it has both an upper and a lower limit of usefulness.

    The lower limit is Planck's constant--Heisenberg's Uncertainty. When you move beyond this point, all your measurements are suspect and you end up with bogus interpretations that don't mean anything. Discovery of a new particle means you merely discovered a new particle; it doesn't mean your theory is correct. You disprove the theory with absurd reduction--only argue the truthfulness of quantum mechanics with a legitimate physicist: someone who has published an article in volume II or later of a scientific journal unequivocally proving the universe did not exist until he and his grad students measured it. Reduction Ad Absurdum.

    The other limit is at the upper end. If there is no limit to figuring things out, then physics leads 'naturally' to chemistry and biology and that with enough effort, you could infer and create the laws of chemistry or biology or human interactions based on the laws of physics.
    We already assume that is absurd but don't examine the idea in depth.
    The easiest understanding occurs when you realize physics covers the whole universe but chemistry only occurs in the realm of planets--hydrogen fusing into helium is physics, not chemistry. The best proof of 'emergence' or new complex areas is from math. Figure out how we go from integers to fractions to irrationals to imaginaries based purely on the opposite of varieties of counting/adding.
    Adding 1 gives you an infinite list of positive integers.
    Inversing or subtracting gives you Zero and the Negative numbers.
    Multiplication is just a faster more restricted form of addition but its inverse gives you fractions--the Rational Numbers.
    Squaring something is just a more restricted version of multiplication but inversing it gives you the Imaginary numbers.

    The various groups of numbers are considered drastically different from each other by mathematicians. They even result in different sizes of Infinity

    1. Re:Limits of physics by Anonymous Coward · · Score: 0

      I sincerely hope you aren't like this all the time. Most of what you said is so far wrong that it's hard to know where to begin addressing it.

      - Emergence from math is an analogy, not a proof.
      - Every set of numbers you gave is a strict superset of the previous set of numbers, so they are not considered drastically different. You can get different number systems that are drastically different, but they don't follow your nice pattern of addition / inversion.
      - "We" do not assume there's anything absurd about deducing chemistry from physics and biology from chemistry. In narrow cases we do it today. However, just as you don't use quantum mechanics to figure out the period of a pendulum, you don't generally reduce every biological reaction to first principles even if it is tractable, and there are admitted gaps in our knowledge at times.
      - No physicist has ever seriously claimed the universe didn't exist until he measured it because that's stupid.
      - Without meaning offense, physicists have a much better grasp of what Heisenberg's uncertainty principle and Planck's constant than you do. It is not the case that "most scientists" need you to explain to them that they cannot measure past these fundamental limits.
      - You're equivocating proof here. Absolute proof is for mathematics / logic. Those sort of proofs are useful to show that your low level theory reduces to an accepted high level theory in certain limits (the second law of thermodynamics arises from the theory of quantum mechanics). If somebody talks about proving a theory true in science, what they mean is gathering evidence that supports the theory and dispels competing theories.

  53. Shouldn't be surprising at all, really by hexagonc · · Score: 1

    I'm not one of those people who scoff at scientific research that confirms what they already "knew" but I'm not all that surprised by this. If you think about what physicists and other scientists actually do, at its core, it must reduce to some combination of constraint satisfaction, tree search or some other statistical search or optimization, all of which are NP-Hard in the worst case. Another prominent method that physicists use on some level, is probabilistic inference, which is also NP-Hard. Unless the knowledge comes from a supernatural insight, the quest to find a better physical model of reality must be subject to the same fundamental constraints that any other optimization problem is.

  54. "Dynamical"? You mean like "nucular"? by Anonymous Coward · · Score: 0

    It's dynamic, not dynamical. Clearly these people skipped undergrad English.

    Perversions in language lead to perversions in thought. Or more simply put, lack of attention to detail in language points to a general lack of attention to detail.

    Fair disclosure: I am ESL too, except I actually bothered. And no, I am not an English major.

    1. Re:"Dynamical"? You mean like "nucular"? by mcswell · · Score: 1

      You'd better tell these folks
            http://mathworld.wolfram.com/DynamicalSystem.html
      they're wrong.

  55. Seems I'm always contrary. Well here goes again. by databaseadmin · · Score: 1

    So the article said that NP problems are all part of one family of problems or just different forms of the same problem. It further says that because these problems are 'hard' they can't be solved by computers. I must say, my gut instinct is that turning this many problems, and problems of this level of importance into one problems is the first step in solving all of them at once. oh, and before you tell me about how we can't see how anyone would really solve the 'NP-hard', first tell me how your so much more clever than the people who told us we would probably never solve this. http://en.wikipedia.org/wiki/Fermat's_Last_Theorem

    ok.

  56. Comment removed by account_deleted · · Score: 1

    Comment removed based on user account deletion

  57. Re:So simulation models are not as good as we thou by Anonymous Coward · · Score: 0

    This still says nothing about how accurate the resulting models are, only how difficult they are to derive. Technically, not even that, but how hard the derivation scales. How difficult it is to verify the resulting model is a different complexity, and unless they also proved physics is both NP-hard and not NP-complete, they've said nothing about that. Even if that were the case, the fact it has to do with scaling means specific cases may still not be that hard. Even if say it were expected to take 1000 man-years of work to derive the model, it might only take a single week to verify it for example.

    For example, just because the the decision version of the traveling salesman problem is NP-complete doesn't mean we can't be sure if any given solution is reliable. The reliability of any solution found is quite easily checked and certain. And of course, such a proof doesn't cast any doubt on reliability of traveling salesman already working...

  58. Re:Exceptions by Anonymous Coward · · Score: 0

    I'm not a conservitard, and I don't have a precious oil-based lifestyle. I believe in the goodness of preventing excess damage to our ecosystem in rational ways. However, I still take issue with the Global Warming cabal. Let me explain my position:

    I see that there's some evidence of warming trends. I don't see anything other than mild correlation and guesswork that it's anthropogenically caused at all, and I certainly don't see any hard science indicating what percentage of it is anthropogenically caused versus a natural background warming pattern. Fundamentally, the problem of proving such things seems completely intractable, because we cannot accurately model our climate's recent past in sufficient detail, and extrapolations (even from good models) are always just extrapolations, they rarely match the reality to come. I still think it's a good idea that we curb our pollution output based on the available evidence, because it's prudent to do so. However, I don't believe there is anything resembling conclusive proof that largely-anthropogenic global warming is happening, and by extension I don't think there's anything resembling conclusive proof that any action we take will reverse any warming trend that may continue to occur over the next several decades.

    Given the above, I can only assume that the unwritten thought process of the Scientific Community is this: Well, it's not really proven, but we think it's prudent to act anyways, so we're just going to try to convince everyone that it's proven beyond doubt so that they'll take action. It's basically lying to people that it's conclusive because you think they're too stupid to take the right course of action based on mere probability. They might be too stupid to otherwise take the right action, but that doesn't make the lie any more legitimate. Worse, the lie backfires, because even people who are too stupid to be prudent about the environment in the face of the current evidence are smart enough to see that you're lying to them. Science started a religious war here, and they're just as much religiously involved as the other guys...

  59. Re:Exceptions by riverat1 · · Score: 1

    I wondered how long it would take to bring up climate science. No climate scientist worth his salt would say it's all been figured out. What they are saying is that they've figured out enough of it, particularly the major factors, that they can make some reasonable projections about what's generally likely to happen under various scenarios. Now they've moved on to filling in details because they don't argue about most of the big things any more. Consensus is what happens when only the crackpots are arguing against it.

  60. Pancake / No Pancake by regular_guy · · Score: 1

    Relating physics to some other delicious item might make this discussion more satisfactory.

  61. Re:So simulation models are not as good as we thou by Ambitwistor · · Score: 2

    Really? Then why did the authors say:

    They didn't.

    Seems like simulation of complex systems like climate are NP-Hard

    No.

    I guess you're going to make me repeat myself here. Try to pay attention.

    What's NP-Hard is an algorithm which can identify the exact dynamical laws that give rise to a set of observed data. This doesn't say anything about the computational complexity of simulating of dynamical laws.

    Furthermore, this result says nothing about the quality (i.e., accuracy) or computational complexity of an algorithm to identify approximate dynamical laws (e.g., computer simulations) from empirical data. For all we know, it's possible to identify approximate dynamical laws to a given system to an arbitrarily high accuracy, in polynomial time. They just can't be determined exactly.

    Finally, this result has nothing in particular to do with any particular system, such as the climate, and it proves no results how hard it is to identify dynamics as a function of system "complexity". It's a statement about the ability of a single algorithm to identify all possible dynamical laws in all possible systems from all possible data.

    which cast serious doubt on the models employed by proponents of human-induced climate change.

    It sounds like you have an ideological axe to grind here. It's apparently not climate models per se you have a problem with, but the fact that they're employed by "proponents of human-induced climate change".

    The theorem doesn't say that identifying climate dynamics from climate data is any harder or easier than identifying gravitational dynamics from trajectory data, chemical dynamics from molecular data, etc. It just says that there isn't a polynomial-time algorithm that can identify dynamical laws from measurements of every possible system.

  62. Re:Seems I'm always contrary. Well here goes again by emt377 · · Score: 1

    NP-hard doesn't mean it can't be "solved". It means there is a large number of solutions and finding the best solution is hard. But finding a single solution isn't necessarily hard. In the case of physics finding a poor solution is trivial, in fact people come up with them all the time. NP-hard means we're doomed to find progressively better approximations, but will likely never find a perfect expression. This also has nothing to do with computers; in fact NP-hard often means only computers can be used to generate progressively better solutions (i.e. search the solution space).

    Also it has nothing to do with Fermat's Theorem. That's about mathematical proof, not creating systems to model reality.

    Finally, the summary says reality is a system "governed" by equations; this is clearly not correct. The system and its equations we use to approximate the behavior of reality are entirely abstract constructs. They exist in our mind as a high-order reflection of reality. They are a part of reality (since we are) but don't "govern" it any more than we do.

  63. Re:So simulation models are not as good as we thou by Ambitwistor · · Score: 1

    The whole point of the article is that such equations, upon which climate simulations do indeed depend, are not easily derived and may not be reliable in many cases.

    No, that's not the point of the article. The point of the article is that there isn't any fast algorithm that can derive ALL dynamical equations PERFECTLY.

    It is silent on which specific dynamical systems admit accurate approximations that can be efficiently identified from data. (This is, as I noted originally, very problem specific and depends on your quality metric and the granularity at which you want answers.)

  64. Re:Here's the deal... by Anonymous Coward · · Score: 0

    I hope you're ready. I'm really huge.

  65. Assume a Spherical.... by Tablizer · · Score: 1

    from the assume-a-spherical-traveling-salesman dept

    America's population is approaching spherical. Perhaps they should call us "NP-Soft", not NP-Hard.

  66. Dynamical? by Relayman · · Score: 1

    "Dynamical" is the same as dynamic so why the unnecessarily long word? Unnecessarily long words contribute to global warming!

    --
    If I used a sig over again, would anyone notice?
  67. Re:So simulation models are not as good as we thou by skids · · Score: 1

    Kate McAlpine, who wrote the story for Science Magazine, specifically says this is a statement from the team that wrote the paper:

    You mean you personally called her up and asked her whether she was paraphrasing or quoting there?

    The whole point of the article is that such equations, upon which climate simulations do indeed depend, are not easily derived and may not be reliable in many cases.

    Wrong, the point of the article is that the generic problem is NP-hard, which says nothing about subfamilies of the problem. If we can safely eliminate part of the solution set based on known properties of the input data other than its values, then it would require an entirely new analysis to determine if a specific solution to that specific problem is NP-hard.

    Secondly, the point is that a non-quantum computer could not guarantee completion of the generic solution to this problem, though if the actual solution turned out to be on a short execution branch, it might spit out a definitive result nonetheless, perhaps even very quickly. But the formulas plugged into simulations are not derived from a generic solution, and they are not derived completely from computational statistics. They are derived from the combined grey matter and computational abilities of the scientific community, who have in fact solved many instances of NP-hard problems despite them being NP-hard, because they have background knowlege that helps them chop away vast portions of the problem space until it is tractable. Part of science is specifying a problem beyond its general family such that specialized solutions may be employed.

    Arguing otherwise is like sitting around waiting for a ping-pong ball to quantum tunnel through the table.

  68. No singularity then? by wytcld · · Score: 1

    So apparently, computers are inadequate to doing physics - something Penrose famously claimed. If so, does this - as Penrose also claimed - prove that consciousness cannot be, at root, computational, since we can do physics (not speaking for myself here) fairly well?

    Or to restate that, whatever our intelligence, in full, is, computers can't do it. Thus the whole prospect of the purported "singularity" is a mirrage - however much some may be taken in by it. There might be some similar prospect where we breed super-intelligent human beings - or dogs for that matter. But it's just not ever going to happen with machines.

    Why? Because machines can't do NP-hard stuff.

    --
    "with their freedom lost all virtue lose" - Milton
    1. Re:No singularity then? by radtea · · Score: 1

      Or to restate that, whatever our intelligence, in full, is, computers can't do it.

      No, Turning machines can't do it. But computers are not Turing machines any more than humans are. Computers have interrupts, which allow them to do real-time I/O. Turing's model does not contain anything like that. So computers can do things Turing machines can't: they CONTAIN a Turing machine (the same could be said of humans) but they are MORE than just a Turing machine.

      Furthermore it has been known for a long time (there's a theorem due to Church about it) that we can solve problems that Turing machines can't.

      The only reason why any of these things are considered remotely open issues is because of incredibly lazy thinking on the part of a great many people who for unaccountable reasons blithely assume that "computable" equals "knowable" when there is absolutely no reason to make that assumption and a vast number of painfully obvious reasons not to.

      --
      Blasphemy is a human right. Blasphemophobia kills.
  69. Physics isn't NP Hard by Anonymous Coward · · Score: 0

    These proofs always seem to fail to challenge their basic assumptions. Physics is likely to come from a subset of possible 'elegant' solutions and thus be identifiable in polynomial, or better time. The ability of physicists to do physics (and the manner in which they do it) would tend to hint that actually physics is not free to take any form but is from a smaller set. This is similar to why compression algorithms work, information is not devoid of redundancy and not all signals are equally probable, likewise not all physical laws are equally probable.

    Sigh I'm sure lots of effort went into this but why can't mathematicians maintain perspective...

    1. Re:Physics isn't NP Hard by Anonymous Coward · · Score: 0

      > Physics is likely to come from a subset of possible 'elegant' solutions and thus be identifiable in polynomial, or better time.
      Would Quantum Mechanics be as elegant without Dirac notation? Would General Relativity be as elegant without tensor notation?

      The solutions are only 'elegant' when built upon sane mathematical structures, and expressed using a suitable notation. History has shown that these notations are often inspired by the physics, and not vice versa.

  70. "Dynamical" by Anonymous Coward · · Score: 0

    OK, "dynamic" is an adjective already. Adding "-al" does not make it another adjective. And no, I don't care if some obtuse dictionary writer accepts it.

  71. The N-body problem by Nedmud · · Score: 1

    Isn't the N-body problem already a stronger result than this?

    Or are they orthogonal? I'm interested in any explanations about how they compare.

    Disclaimer: IANAP and have not RTFA.

  72. Re:Exceptions by readin · · Score: 1

    It's not a religion, well, except for the deniers.

    "Deniers"? Is that your religion's term for heathens?

    --
    I often don't like the choices people make, but I like the fact that people make choices. That's why I'm a conservative.
  73. hahahaha! by crutchy · · Score: 1

    dynamical

    i'm myaat daaaaaymon!

  74. Re:Exceptions by siride · · Score: 1

    No, that's a reasonable term for what many of them are. I'm not necessarily talking about the scientist with a blog who's a skeptic. I mean the legions of regular folks and politicians who believe, for no good scientific reason, that global warming can't be happening, or if it is, it just can't be because of humans. If you want a religion, there's one right there.

  75. Re:Exceptions by readin · · Score: 1

    Ok. I guess I was being silly. I thought you had borrowed a word that had come to be associated with "holocaust deniers" and used it to smear people who disagreed with you.

    --
    I often don't like the choices people make, but I like the fact that people make choices. That's why I'm a conservative.
  76. Re:Exceptions by ceoyoyo · · Score: 1

    Determining that acceleration due to gravity is 9.81 m/s^2 is easy. It's a linear least squares problem that is most definitely polynomial (and low order at that). Figuring out that F=ma is (apparently) NP-hard.

  77. Comment removed by account_deleted · · Score: 1

    Comment removed based on user account deletion

  78. Re:Exceptions by mcswell · · Score: 1

    So what's your term for the legions of regular folks and politicians who believe, for no good scientific reason, that global warming is happening, and that it must be because of humans? True believers? Fundamentalists?

    Most of us don't have the data and time to decide whether global warming is happening, or whether it's a result of instrument error, misinterpretation of tree rings, etc.; and the further we go back, the harder the question becomes. (Well, maybe until the close of the last Ice Age.) So we take someone's word for it. We used to call such people priests, now we call them scientists. And since we can't validate their data, we rely on secondary and tertiary evidence to decide whether we believe. Secondary evidence might include consistency among different climate scientists, or whether specialists in fields like statistics find the climate scientists' use of statistics to be correct. Tertiary evidence might be judgments about whether their sources of income bias them (in either direction!), or whether they try to suppress contrary opinions.

    If most of us must rely on secondary or tertiary evidence to decide *whether* global warming is happening, then it's even harder to decide whether it's caused by humans (or to what extent it's caused by humans). Certainly there are other possibilities, which we--and for that matter scientists--are largely ignorant about.

    Personally, I think "skeptic" is a much better term.

  79. Re:Ow, my brain by ed1park · · Score: 1

    Basically they are saying that even if you had tons of great and accurate data, the algorithm to process everything to generate the equations would prove to require too much time to compute. Like trying to crack AES 256 bit encryption or worse depending on the situation.

    BTW, here's a pretty good link explaining NP a little better.
    http://explorations.chasrmartin.com/2008/11/24/what-are-p-np-complete-and-np-hard/

  80. Re:Exceptions by riverat1 · · Score: 1

    Considering that if some of the worst things that scientists think might happen do happen climate science deniers might be looked down upon in the same way holocaust deniers currently are in the future.

  81. Re:Exceptions by siride · · Score: 1

    A skeptic is someone who really does look at the available evidence with a critical but open eye and who has the critical thinking skills to synthesize new knowledge and understanding from that, be it just for themselves, or for the world at large. The Fox News crowd does not generally fall into that category. They did not come to the global warming debate with the idea that it's a serious issue that must be examined critically and deeply. Instead, they come at it with the idea that it's all a big liberal conspiracy and can't possibly be true. That's not skepticism, that's just plain denial. There *are* skeptics (I mentioned that). A lot of the people who don't buy into global warming are not skeptics, but merely deniers. Likewise, there are people who buy into global warming without any critical thinking and so are just lemmings and bad in their own way. I won't defend them either.

    Your middle paragraph makes a very dangerous and misguided point. There is, in fact, a big difference between a prophet claiming to speak for God and a scientist doing research and publicizing the results. The latter is actually verifiable. The latter's methods are public and known. The latter's methods must furthermore work and bear fruit. String theory gets laughed at here and elsewhere because it fails these things. And yet dogmatic religion last thousands of years despite countless pieces of evidence and arguments against it. No scientific theory would ever last that long if it had no truth value whatsoever. Bad science *does* get weeded out, even if it is politicized. In the end, there really is more value in coming up with the truth than just being right for the sake of being right. If global warming really is a big hoax, a big scientific blunder, it *will* be uncovered. Not through hacked emails or out-of-context quotes from a random climate scientist. It'll come out through actual, peer-reviewed science. Remember also that it's in the system's interest for global warming to be false. As such, any real evidence against it would have strong political backing.

  82. Not surprising at all by Anonymous Coward · · Score: 0

    Even Tetris game is NP-hard.

  83. Re:Seems I'm always contrary. Well here goes again by databaseadmin · · Score: 1

    The reason why I brought up Fermat's Theorem, is that very well argued explanations of what we can't figure-out or do, supplied by very highly credentialed persons, has not been a barrier to actually solving problems. Fermat's is an example of something, that was generally felt to be unsolvable, for centuries, but then was later solved in a way that you could almost call kinda simple.

    Making 100s of important problems into what is kinda 1 problem, is the first step in solving 100s of problems all at once.

    Considering your argument, if I could turn the 100s of NP-hard problems into something that could be explained to a computer as one problem. I could run an algorithm against it, and from time to time, get marginally better results. Until, I just didn't care about the results being better. Once that is achieved, for me, the problem is solved. Once, most people just don't care about the slightly better results, it has been generally solved.

    can't be solved, phish posh.

    still being contrary, I suppose.