JUMP

TIME MACHINE

  • (4 Pages)
  • +
  • 1
  • 2
  • 3
  • 4

52 Replies - 21243 Views - Last Post: 05 October 2011 - 04:39 AM

#16 computerfox  Icon User is offline

  • straight vegetarian kid

Reputation: 50
  • View blog
  • Posts: 3,772
  • Joined: 29-January 09

Re: JUMP

Posted 22 May 2009 - 12:43 PM

haha!!!! i'll give you that steffan. you are at notch -2.

#17 P4L  Icon User is offline

  • Your worst nightmare
  • member icon

Reputation: 34
  • View blog
  • Posts: 2,788
  • Joined: 07-February 08

Re: JUMP

Posted 22 May 2009 - 12:47 PM

Hmmm....

3/15/2006

The day I asked mommy to marry me....of course I wouldn't have Minicoder, but I'd have a lot more happiness, and less headaches!

#18 computerfox  Icon User is offline

  • straight vegetarian kid

Reputation: 50
  • View blog
  • Posts: 3,772
  • Joined: 29-January 09

Re: JUMP

Posted 22 May 2009 - 12:49 PM

haha!!! how did i know josh would say something about that :D look at the bright side, sure you are probably gonna get an anorism, but minicoder might prevent that :)

#19 Programmist  Icon User is offline

  • CTO
  • member icon

Reputation: 252
  • View blog
  • Posts: 1,833
  • Joined: 02-January 06

Re: JUMP

Posted 22 May 2009 - 01:51 PM

View Postcomputerfox, on 22 May, 2009 - 12:25 PM, said:

nice goal, but is that even possible other than one of them being 1?

I think that one flew right over several heads.

BTW - P = NP...not gonna happen. And you're very unlikely to get anyone to fund such research. Nice to dream though. :)

This post has been edited by Programmist: 22 May 2009 - 01:55 PM


#20 Zerobu  Icon User is offline

  • Black Hatter

Reputation: 13
  • View blog
  • Posts: 1,822
  • Joined: 14-January 08

Re: JUMP

Posted 22 May 2009 - 02:42 PM

actually I'm working on that proof as we speak....
think of the things i can do with 1 million dollars :D

#21 mostyfriedman  Icon User is offline

  • The Algorithmi
  • member icon

Reputation: 727
  • View blog
  • Posts: 4,473
  • Joined: 24-October 08

Re: JUMP

Posted 22 May 2009 - 03:37 PM

for me its not about the money. instead i want to make a great contribution to science for the people

#22 Locke  Icon User is offline

  • Sarcasm Extraordinaire!
  • member icon

Reputation: 521
  • View blog
  • Posts: 5,596
  • Joined: 20-March 08

Re: JUMP

Posted 22 May 2009 - 06:49 PM

October 1st, 2008 at 12:59 PM...

I'd slap myself silly. 'Nuff said.

This post has been edited by Locke: 22 May 2009 - 06:49 PM


#23 computerfox  Icon User is offline

  • straight vegetarian kid

Reputation: 50
  • View blog
  • Posts: 3,772
  • Joined: 29-January 09

Re: JUMP

Posted 23 May 2009 - 01:41 AM

do i want to know?

#24 Gloin  Icon User is offline

  • Expert Schmexpert...
  • member icon

Reputation: 235
  • View blog
  • Posts: 4,489
  • Joined: 04-August 08

Re: JUMP

Posted 23 May 2009 - 02:41 AM

View Postmostyfriedman, on 22 May, 2009 - 07:23 PM, said:

1/1/2013
when i make a great contribution to the field of mathematics and computer science like when i prove that NP = P

View Postcomputerfox, on 22 May, 2009 - 07:25 PM, said:

nice goal, but is that even possible other than one of them being 1?

Actually only when N=1 but also when P=0, although that was not at all what he meant.

View PostZerobu, on 22 May, 2009 - 09:42 PM, said:

actually I'm working on that proof as we speak....
think of the things i can do with 1 million dollars :D


Yeah, like you'd bother with the million dollars. If it could be proven that P = NP the entire world economy would collapseand those $$$ would be useless. Encryption/Decryption would be worthless and terrorists would destroy the world, starting with America.
So keep up the good work..

#25 computerfox  Icon User is offline

  • straight vegetarian kid

Reputation: 50
  • View blog
  • Posts: 3,772
  • Joined: 29-January 09

Re: JUMP

Posted 23 May 2009 - 02:44 AM

@gloin dude!!!!! :shocked: i'm amazed at your epic level. shamwow!!!!!!

#26 Gloin  Icon User is offline

  • Expert Schmexpert...
  • member icon

Reputation: 235
  • View blog
  • Posts: 4,489
  • Joined: 04-August 08

Re: JUMP

Posted 23 May 2009 - 02:46 AM

my huh?

Proving P != NP is just as useful but much less dangerous...

#27 computerfox  Icon User is offline

  • straight vegetarian kid

Reputation: 50
  • View blog
  • Posts: 3,772
  • Joined: 29-January 09

Re: JUMP

Posted 23 May 2009 - 02:54 AM

iono your level of epicity<<i think i just made up a new word :D

well 99 per cent of the time that proof would be correct so what would it really prove? as you said completely useless, but at least you can bet someone and win almost every time :P

#28 Gloin  Icon User is offline

  • Expert Schmexpert...
  • member icon

Reputation: 235
  • View blog
  • Posts: 4,489
  • Joined: 04-August 08

Re: JUMP

Posted 23 May 2009 - 03:00 AM

Actually that's the opposite of what I said..

#29 computerfox  Icon User is offline

  • straight vegetarian kid

Reputation: 50
  • View blog
  • Posts: 3,772
  • Joined: 29-January 09

Re: JUMP

Posted 23 May 2009 - 03:02 AM

haha yeah i just realized that. shhh!!!! how useful is proving 1 != 2?

#30 Gloin  Icon User is offline

  • Expert Schmexpert...
  • member icon

Reputation: 235
  • View blog
  • Posts: 4,489
  • Joined: 04-August 08

Re: JUMP

Posted 23 May 2009 - 04:03 AM

That's still not the issue but since you mention it, it's rather useful to prove that 1 != 2. If you can't do that then all mathematics would fail, wouldn't it?!

P denotes the class of problems that can be solved in polynomial-time.
NP denotes the class of non-deterministic polynomial problems, meaning they could be solved in polynomial time using a non-deterministic Turing machine (if you have one of those, I'm ready to buy).

P is in the class of NP but not equal to it (most likely). Other parts of the NP class are the NP-Complete class and the class of incomplete problems.

When talking about problems, it's usually assumed to be decision problems (yes/no) but since a decision problem can be used to solve an optimization problem the optimization problem is in P if the decision problem is in P. You only use a method similar to the binary search method (which only adds a multiplicative factor O(c*log(n))) to convert the decision problem into an optimization problem.

Am I turning this into a CS thread now?

I'm sorta guessing you knew this already but in case someone else didn't..

This post has been edited by Gloin: 23 May 2009 - 04:01 AM


  • (4 Pages)
  • +
  • 1
  • 2
  • 3
  • 4