Sunraiser
@sunraiser.bsky.social
Stormlight archive enjoyer. Arsenal Supporter
Popular YouTuber Blou QUESTIONS the plausibility of P = NP, suggesting it’s false.
“If efficiently verifying a solution means we can also efficiently find one, why have we seen no practical evidence of it?
What if the complexity that separates P from NP is an inherent feature of computation itself?”
“If efficiently verifying a solution means we can also efficiently find one, why have we seen no practical evidence of it?
What if the complexity that separates P from NP is an inherent feature of computation itself?”
March 30, 2025 at 2:07 AM
Popular YouTuber Blou QUESTIONS the plausibility of P = NP, suggesting it’s false.
“If efficiently verifying a solution means we can also efficiently find one, why have we seen no practical evidence of it?
What if the complexity that separates P from NP is an inherent feature of computation itself?”
“If efficiently verifying a solution means we can also efficiently find one, why have we seen no practical evidence of it?
What if the complexity that separates P from NP is an inherent feature of computation itself?”
You’re this guy I’m afraid
November 18, 2024 at 10:17 PM
You’re this guy I’m afraid