🧵 Untitled Thread
Anonymous at Fri, 6 Sep 2024 21:41:03 UTC No. 16364464
Is this correct? I have a feeling it isn't.
Anonymous at Fri, 6 Sep 2024 21:52:25 UTC No. 16364497
Anonymous at Sat, 7 Sep 2024 03:44:02 UTC No. 16365160
>>16364497
Bot
Anonymous at Sat, 7 Sep 2024 04:01:49 UTC No. 16365222
>>16365160
>venn diagrams aren't lust provoking
fag alert
Anonymous at Sat, 7 Sep 2024 05:50:18 UTC No. 16365362
>>16364464
NTMs won't solve NP-complete in polynomial time. That's nonsense.
Quantum computers can't run general purpose software so they may solve some NP-complete efficiently but require distinct hardware for each type of problem. Unlike NTMs, there's no easy transference between problems in the same computational class.
Anonymous at Sat, 7 Sep 2024 06:52:22 UTC No. 16365413
>>16365362
nigga do you even know what NP-complete means?
if it can solve just 1 NP-complete problem, it can solve all NP problems
Anonymous at Sat, 7 Sep 2024 10:25:24 UTC No. 16365635
>>16364464
>a feeling
Anonymous at Sat, 7 Sep 2024 14:12:13 UTC No. 16365877
>>16364497
Kek
Anonymous at Sat, 7 Sep 2024 14:12:24 UTC No. 16365878
>>16364464
The teapot test for quantum computers
https://www.youtube.com/watch?v=sFh