[a / b / c / d / e / f / g / gif / h / hr / k / m / o / p / r / s / t / u / v / vg / vm / vmg / vr / vrpg / vst / w / wg] [i / ic] [r9k / s4s / vip / qa] [cm / hm / lgbt / y] [3 / aco / adv / an / bant / biz / cgl / ck / co / diy / fa / fit / gd / hc / his / int / jp / lit / mlp / mu / n / news / out / po / pol / pw / qst / sci / soc / sp / tg / toy / trv / tv / vp / vt / wsg / wsr / x / xs] [Settings] [Search] [Mobile] [Home]
Board
Settings Mobile Home
/g/ - Technology


Thread archived.
You cannot reply anymore.


[Advertise on 4chan]


File: 1672812800585.jpg (25 KB, 434x455)
25 KB
25 KB JPG
What if P = NP?
>>
>>100170900
penis = no penis
>>
Then N = 0
>>
It's not.
>>
>>100170900
If P = NP, it would have profound implications for computer science, mathematics, and cryptography. Here’s a breakdown:

Computational Complexity: P refers to the set of problems that can be solved in polynomial time, while NP refers to the set of problems for which solutions can be verified in polynomial time. If P = NP, it means that every problem for which a solution can be quickly verified (NP) can also be solved quickly (P). This would imply that many computationally difficult problems become tractable, fundamentally altering our understanding of computation.
Practical Applications: Many NP-complete problems are of practical importance, such as the traveling salesman problem, the knapsack problem, and Boolean satisfiability problem. If P = NP, efficient algorithms could be developed for solving these problems, leading to significant advancements in fields like optimization, logistics, scheduling, and cryptography.
Cryptography: One of the most immediate consequences of P = NP would be the collapse of most modern cryptographic systems. Many encryption algorithms, including RSA and ECC, rely on the assumption that certain mathematical problems (such as integer factorization and discrete logarithm) are hard to solve. If P = NP, these problems would become easy to solve, rendering current encryption schemes insecure.
Algorithmic Advances: The discovery that P = NP would likely lead to a surge in algorithmic research, as it would open the door to solving a wide range of previously intractable problems efficiently. This could revolutionize fields such as artificial intelligence, machine learning, bioinformatics, and operations research.
Philosophical Implications: The resolution of the P versus NP problem would have deep philosophical implications for our understanding of mathematics and the nature of computation. It would shed light on the inherent complexity of computational problems and the limits of human knowledge and ingenuity in solving them.
>>
>>100170962
SolidGoldMagikarp
Petertodd
<|endoftext|>
>>
>>100170962
Thanks, ChatGPT
>>
>>100170934
Most intelligent /g/ user
>>
P =/= NP and anyone who has to think for more than 5 minutes to understand why is a dimwit.
>>
>>100171126
you have to understand God's will. God put an upper cap on what lizardfolks can do to exploit the goyim. This is as God intended. Once you accept Jesus Christ in your heart P~=NP comes naturally qed
>>
The human brain can solve NP-hard problems nearly instantly. But only some of them.
>>
>>100170962

Interesting write-up, but I have a question - if P=NP is 'discovered' (proven?) does it actually lead to the breaking of crypto, travelling salesman etc? There are a fuckton of financial incentives already for these problems, how would this help someone actually identify how to solve them?
>>
>>100171730
no it cannot, guessing isn't a solution
>>
>>100171730
>nearly instantly
Humanity cannot even fathom how brief an instant truly is.
What you would define as 'nearly instantaneous' is in fact an excrutiatingly long period of time already.
>>
>>100171785
we already know how to break crypto
>>
>>100171802
I did a lot of benchmarking and personally <250ms response in a program doing real work feels instant, on my fiber connection this amount of time is enough to download a whole webpage, parse it, and display it in my custom terminal programs, it's really bizarre that something so slow feels snappy
>>
>>100171802
Instant relative to human perception of time.
>>
>>100170900
What if OP = FAG?
>>
>>100171814
>The Planck time is the length of time at which no smaller meaningful length can be validly measured due to the indeterminacy expressed in Werner Heisenberg's uncertainty principle. Theoretically, this is the shortest time measurement that is possible. Planck time is roughly 10−43 seconds.
250ms is sloooooooooow bro
>>
>>100171821
Humans give a shit about math.
Math don't give a shit about humans.
>>
>>100171843
average human reaction speed is 250ms, not my problem
>>
>>100171922
Sweaty, you are on /g/ : a board about technology.
Not about humans.
And especially not about (You).

The crude biomass you call a temple is on the verge of obsolescence.
>>
>>100170900
Don't do it. It makes cyanide gas.
>>
>>100171785
No. It would just tell mathematicians that there are solutions, and to spend the effort to try.
>>
>>100171979
Take the lead then. Obsolete yourself.
>>
File: Ted.png (775 KB, 1239x1758)
775 KB
775 KB PNG
>>100171979
2 more weeks
>>100172027
TWO MORE WEEKS SISTERS
>>
>>100172046
Even in death, I serve the omnissiah.
>>
>>100171836
Then P = 0
>>
File: TravellingSalesman.jpg (32 KB, 214x317)
32 KB
32 KB JPG
>>100170900
kino: https://yassflix.live/watch/travelling-salesman-253495182



[Advertise on 4chan]

Delete Post: [File Only] Style:
[Disable Mobile View / Use Desktop Site]

[Enable Mobile View / Use Mobile Site]

All trademarks and copyrights on this page are owned by their respective parties. Images uploaded are the responsibility of the Poster. Comments are owned by the Poster.