Tuesday, April 26, 2005
Geekology, Anyone?
The Uber-Challenge
The theorem is a hack on discrete number theory that simultaneously disproves the Chuirch-Turing hypothesis [wave if you understood that] and worse, permits NP-complete problems to be converted into P-complete ones. This has several consequences, starting with screwing over most cryptography algorithms—translation: all your bank account are belong to us—and ending with the ability to computationally generate a Dho-Nha geometry curve in real time.
a] Who wrote it?
b] Explain it.
Page 1 of 1 pages
Statistics
This page has been viewed 18343676 times
Total Entries: 5718
Total Comments: 4193
Total Trackbacks: 714
Most Recent Entry: 06/14/2011 06:44 am
Most Recent Comment on: 11/27/2011 05:18 pm
{/if}
