« first day (2105 days earlier)      last day (2320 days later) » 

vzn
vzn
2:29 AM
in theory salon, 9 hours ago, by vzn
The impossibility of intelligence explosion / Chollet see also aaronson https://www.scottaaronson.com/blog/?p=3553 and barak https://windowsontheory.org/2017/12/09/on-the-impossiblity-of-intelligence-explo‌​sion/
 
 
15 hours later…
ng.newbie
ng.newbie
5:22 PM
Guys can anyone tell me if negative weights are allowed in the 0/1 knapsack problem ?
if not then how is the subset sum a special case of the 0/1 knapsack problem ?
 
Mees de Vries
Mees de Vries
You can always reduce subset sum for a set S and a sum T to all positive weights by iterating k from 1 to |S|, adding -min(S) to all elements of S, and looking for sum T-k*min(S).
 

« first day (2105 days earlier)      last day (2320 days later) »