Thread: t-shirt

Hybrid View

Previous Post Previous Post   Next Post Next Post
  1. #1
    C++ Witch laserlight's Avatar
    Join Date
    Oct 2003
    Location
    Singapore
    Posts
    28,413
    Quote Originally Posted by Mario F.
    The sentence is: "Thus I equal the solution to the verification of that solution." And under the concept of faith, I'm confused what there is to explain that I haven't already. What is that you don't understand?

    How do you verify your faith, if not by the very formulation of the faith itself?
    I can understand that part, but then from what I understand, your conclusion does not follow. How do you manage to conclude P = NP from a flawed proof of P != NP? (EDIT: Or are you saying that from a contradiction, we can derive anything... but there is no clear contradiction since this is an open problem, and even if there was, "anything" includes supporting P != NP.)

    Quote Originally Posted by Mario F.
    No. We just don't know yet. It hasn't be proven yet. We can feel more inclined that way, we may accept that as the most probable answer. But we don't know yet. And trying to pretend we know is not science.
    I think Yarin was trying to be pedantic about the difference in rigour in mathematical proofs and scientific theories.
    Quote Originally Posted by Bjarne Stroustrup (2000-10-14)
    I get maybe two dozen requests for help with some sort of programming or design problem every day. Most have more sense than to send me hundreds of lines of code. If they do, I ask them to find the smallest example that exhibits the problem and send me that. Mostly, they then find the error themselves. "Finding the smallest program that demonstrates the error" is a powerful debugging tool.
    Look up a C++ Reference and learn How To Ask Questions The Smart Way

  2. #2
    (?<!re)tired Mario F.'s Avatar
    Join Date
    May 2006
    Location
    Ireland
    Posts
    8,446
    Quote Originally Posted by laserlight View Post
    I can understand that part, but then from what I understand, your conclusion does not follow. How do you manage to conclude P = NP from a flawed proof of P != NP?
    Ah, I think I can understand the source of our confusion, now.

    I'm not concluding that proves P = NP. I'm merely saying that by their own admission of faith they are in fact making their case for P = NP. Because both the solution and the verification of that solution become equal in complexity.
    Originally Posted by brewbuck:
    Reimplementing a large system in another language to get a 25% performance boost is nonsense. It would be cheaper to just get a computer which is 25% faster.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. I'm trying to count the frequency of the phrase "ing"
    By thefreeman1159 in forum C Programming
    Replies: 14
    Last Post: 09-23-2008, 11:58 AM
  2. Calling functions help
    By ForlornOdium in forum C++ Programming
    Replies: 14
    Last Post: 09-29-2003, 08:40 PM
  3. Clean Jokes
    By stevey in forum A Brief History of Cprogramming.com
    Replies: 35
    Last Post: 04-27-2002, 07:13 PM