suppressingfire

7 ms·

31.
by suppressingfire 14y ago
IBM - 433,362
32.
by suppressingfire 16y ago
But the getacoder poster only specified that it had to be done in polynomial time, and didn't clarify whether that had to be total CPU time (i.e., "work") or wall clock time. Given that underspecification, it's perfectly justifiable to use
33.
by suppressingfire 16y ago
Depends on the problem and how you distribute data. e.g., each node can generate its own subset to check, so you only need to distribute the program and input. That can be done using a multicast tree of some kind which brings distribution c
34.
by suppressingfire 16y ago
As a re-representation of the DNA computing work cited above, you can actually do exponential work in poly time using a photocopier. EDIT: here's a link to a paper describing this approach: http://www.springerlink.com/content/j5213p8761224
35.
by suppressingfire 16y ago
Whoa... I never thought I'd see my dad's work reffed on HN.
36.
by suppressingfire 16y ago
Since the post only specified polynomial time and placed no constraint on space, this is actually solvable (e.g., it's not too hard to come up with an polynomial implementation that uses a number of VMs that grows exponentially with the s
37.
by suppressingfire 16y ago
Right, and then bring together all those related posts, so I have the links to both the reddit comments and the HN comments in the same context as the original article link.
38.
by suppressingfire 16y ago
What if they're wrong based on what they said AND who they are?
39.
by suppressingfire 16y ago
I've seen the same issue intermittently with gmail and calendar under Firefox 3.6, even though I'm properly logged in to iGoogle and reader...