Cook-Levin theorem on wikipedia states that: "An important consequence of this theorem is that if there exists a deterministic polynomial time algorithm for solving Boolean satisfiability, then every NP problem can be solved by a deterministic polynomial time algorithm." Now, the important thing to recognise is that a deterministic polynomial time algorithm for solving Boolean satisfiability actually exists, it's just that the definition of what polynomial time is, is different from person to person. The algorithm is the boundary of P and NP, or the encoding from one to the other. And the situation is that the exponential function is equivalent to an infinite series of polynomials. Thus, NP is merely an infinite series of P. Thus, all NP problems are solvable in P time, so long as you can count to an infinite accuracy of P. It's not a question of P or NP, but of discreteness and continuity. Seeing as NP algorithms require one of two things, irrational discreteness, or irrational continuity, and the second includes the first. Because, the polynomial algorithms that encodes NP require very very accurate numbers for the polynomial multipliers, or an infinite amount of them. Either way, knowing the answer to an NP question, skips all time to compute it. The problem is in the calculable discreteness of P. If you can't define every actual number (those between 0 and 1) then you can't count at all, comparably.

Viewcount: 413Viewcount: 250

Viewcount: 441

Viewcount: 299

Viewcount: 228

Viewcount: 248

Viewcount: 378

Viewcount: 249

Viewcount: 540

Viewcount: 233

Viewcount: 243

Viewcount: 204

Viewcount: 241

Viewcount: 238

Viewcount: 234

Viewcount: 222

Viewcount: 232

Viewcount: 236

Viewcount: 252

Viewcount: 204

Viewcount: 221

Viewcount: 313

Viewcount: 388

Viewcount: 571

Viewcount: 270

Viewcount: 239

Viewcount: 245

Viewcount: 614

Viewcount: 208

Viewcount: 322

Viewcount: 226

Viewcount: 333

Viewcount: 207

Viewcount: 220

Viewcount: 223

Viewcount: 200

Viewcount: 209

Viewcount: 265

Viewcount: 188

Viewcount: 262

Viewcount: 201

Viewcount: 196

Viewcount: 220

Viewcount: 249

Viewcount: 320

Viewcount: 235

Viewcount: 232

Viewcount: 178

Viewcount: 205

Viewcount: 191

Viewcount: 238

Viewcount: 187

Viewcount: 346

Viewcount: 300

Viewcount: 293

Viewcount: 211

Viewcount: 202

Viewcount: 413

Viewcount: 271

Viewcount: 203

Viewcount: 199

Viewcount: 211

Viewcount: 348

Viewcount: 220

Viewcount: 217

Viewcount: 189

Viewcount: 211

Viewcount: 229

Viewcount: 218

Viewcount: 204

Viewcount: 227

Viewcount: 214

Viewcount: 205

Viewcount: 287

Viewcount: 226

Viewcount: 225

Viewcount: 200

Viewcount: 188

Viewcount: 219

Viewcount: 338

Viewcount: 200

Viewcount: 199

Viewcount: 209

Viewcount: 235

Viewcount: 211

Viewcount: 211

Viewcount: 252