My Math Forum  

Go Back   My Math Forum > Science Forums > Computer Science

Computer Science Computer Science Forum


Reply
 
LinkBack Thread Tools Display Modes
May 11th, 2018, 06:41 AM   #1
Senior Member
 
Joined: Mar 2015
From: England

Posts: 201
Thanks: 5

I may have a lead P = NP

I am so sorry about this, I apologize profusely, I'm frustrated that this has happened, but never the less here we are.

Here is the definition of P = NP according to Wikipedia

"The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified (technically, verified in polynomial time) can also be solved quickly (again, in polynomial time)."

I do believe I have found evidence in the natural world that the answer is yes.

Type II topoisomerases enzyme according to Wikipedia

"Type II topoisomerases cut both strands of the DNA helix simultaneously in order to manage DNA tangles and supercoils."

Last edited by HawkI; May 11th, 2018 at 06:43 AM.
HawkI is offline  
 
May 11th, 2018, 06:43 AM   #2
Senior Member
 
Joined: Mar 2015
From: England

Posts: 201
Thanks: 5

In this example it's easy to see that tangles and super coils are problems
HawkI is offline  
May 11th, 2018, 04:05 PM   #3
Senior Member
 
Joined: Feb 2016
From: Australia

Posts: 1,649
Thanks: 572

Math Focus: Yet to find out.
...
Joppy is offline  
May 11th, 2018, 04:10 PM   #4
Senior Member
 
Joined: Aug 2012

Posts: 2,010
Thanks: 574

Quote:
Originally Posted by HawkI View Post
Here is the definition of P = NP according to Wikipedia

"The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified (technically, verified in polynomial time) can also be solved quickly (again, in polynomial time)."
Is that the formal definition? Or is that a summary of a popularized characterization of the actual definitions, which are far more technical?

Do you understand that you have not given the proper definitions of P and NP?

Do you know what the definitions are?

Last edited by Maschke; May 11th, 2018 at 04:16 PM.
Maschke is offline  
May 11th, 2018, 05:00 PM   #5
Senior Member
 
Joined: May 2016
From: USA

Posts: 1,126
Thanks: 468

Quote:
Originally Posted by HawkI View Post
I am so sorry about this, I apologize profusely, I'm frustrated that this has happened, but never the less here we are.

Here is the definition of P = NP according to Wikipedia

"The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified (technically, verified in polynomial time) can also be solved quickly (again, in polynomial time)."

I do believe I have found evidence in the natural world that the answer is yes.

Type II topoisomerases enzyme according to Wikipedia

"Type II topoisomerases cut both strands of the DNA helix simultaneously in order to manage DNA tangles and supercoils."
Unless you have some information on the length of time that was required for these enzymes to evolve, I have no idea what relevance these enzymes have to the P vs NP problem. In fact, I cannot think of a less promising field to look for P = NP than in the comparative rates of evolutionary development and physiological process.
JeffM1 is offline  
Reply

  My Math Forum > Science Forums > Computer Science

Tags
lead



Thread Tools
Display Modes


Similar Threads
Thread Thread Starter Forum Replies Last Post
A few cheap safe power sources to obsolete fusion and lead to dyson rings BenFRayfield Physics 0 November 16th, 2014 02:26 AM





Copyright © 2018 My Math Forum. All rights reserved.