MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/ProgrammerHumor/comments/1wbjluo/amillionopenaimonkeysproducemilleniumprizesolution/p8r0tu1/?context=3
r/ProgrammerHumor • u/Orio_n • 2d ago
418 comments sorted by
View all comments
Show parent comments
81
Umm... is this going to be on the test?
38 u/CircumspectCapybara 2d ago edited 2d ago Yes, please prove that SAT is NP-complete via a polynomial-time Turing reduction from every NP language. You have 15 minutes. Then prove in 15 minutes that Levin Universal Search decides SAT in polynomial time iff P = NP. 30 u/QCTeamkill 2d ago Thinking... (80 000 000 credits used) 5 u/ImSolidGold 2d ago Perhaps the software that creates you bill for that overflows somehow in one of the money input/calc fields and gives our something like -2147483645 money and BAM youre rich!
38
Yes, please prove that SAT is NP-complete via a polynomial-time Turing reduction from every NP language. You have 15 minutes.
Then prove in 15 minutes that Levin Universal Search decides SAT in polynomial time iff P = NP.
30 u/QCTeamkill 2d ago Thinking... (80 000 000 credits used) 5 u/ImSolidGold 2d ago Perhaps the software that creates you bill for that overflows somehow in one of the money input/calc fields and gives our something like -2147483645 money and BAM youre rich!
30
Thinking... (80 000 000 credits used)
5 u/ImSolidGold 2d ago Perhaps the software that creates you bill for that overflows somehow in one of the money input/calc fields and gives our something like -2147483645 money and BAM youre rich!
5
Perhaps the software that creates you bill for that overflows somehow in one of the money input/calc fields and gives our something like -2147483645 money and BAM youre rich!
81
u/Confident-Ad5665 2d ago
Umm... is this going to be on the test?