Remember MEMCOMPUTING? Forget it, it's NP-Complete.
1
Name:
Anonymous
2015-02-18 9:17
http://www.scottaaronson.com/blog/?p=2212 Sorry guys, it's over. Even when you can compute the result in P recovering the result is in NP.
2
Name:
Anonymous
2015-02-18 9:25
MEMECOMPUTING
3
Name:
Anonymous 2015-02-18 9:48
I'm not reading all that shit. Summarize the article in one word.
4
Name:
Anonymous
2015-02-18 10:06
>>3 Sorry, "get fucked" is two words.
5
Name:
Anonymous
2015-02-18 10:16
>>3 The Forced Exponetiality Of The Subset Sum
6
Name:
Anonymous
2015-02-18 10:19
IIRC, what it promised was just a cheap computing element integrated with memory. That has nothing to do with solving NP problems in P time.
7
Name:
Anonymous
2015-02-18 11:30
>>5 Yes you. Good job.
>>6 The first paragraph mentions the paper titled “Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states.”
8
Name:
Anonymous
2015-02-18 17:09
A bunch of people (on Hacker News, Reddit, and elsewhere /elsewhere/ is
/prog/ .
9
Name:
Anonymous
2015-02-18 17:14
>>8 no it's slashdot you cretin
10
Name:
Anonymous
2015-02-18 17:15
>>6 You're confusing that with memristors.
11
Name:
Anonymous
2015-02-19 2:00
>>10 You're confusing that with my dubs.
12
Name:
Moshe Hoaxsky
2015-02-19 5:07
Shalom!
13
Name:
Anonymous
2015-02-19 11:59
>>1 Scott Aaronson is a Jew who wants to trick the goyim away from superior computing paradigms, so that Jews can secretly keep it to themselves.