Difference between revisions of "Talk:1952: Backpack Decisions"

Explain xkcd: It's 'cause you're dumb.
Jump to: navigation, search
(bike-shed effect)
(+comment)
Line 4: Line 4:
 
And I now want a new backpack. I'm fine with the one I have, but *I want a new one dammit!* But I can't decide which one [[User:Jdluk|Jdluk]] ([[User talk:Jdluk|talk]]) 15:08, 7 February 2018 (UTC)
 
And I now want a new backpack. I'm fine with the one I have, but *I want a new one dammit!* But I can't decide which one [[User:Jdluk|Jdluk]] ([[User talk:Jdluk|talk]]) 15:08, 7 February 2018 (UTC)
  
The knapsack optimization problem is famous for being NP-hard ([https://en.wikipedia.org/wiki/Knapsack_problem Knapsack problem on Wikipedia]). Seems to be an allusion to it. Sebastian --[[Special:Contributions/162.158.91.191|162.158.91.191]] 15:53, 7 February 2018 (UTC)
+
The knapsack optimization problem is famous for being NP-hard ([[wikipedia:Knapsack problem|Knapsack problem]]). Seems to be an allusion to it. Sebastian --[[Special:Contributions/162.158.91.191|162.158.91.191]] 15:53, 7 February 2018 (UTC)
 +
: Nope, see below. The knapsack problem is about optimizing the amount of stuff put into something, while Cueball goes through a [[wikipedia:buying decision process|buying decision process]]. [[Special:Contributions/162.158.114.100|162.158.114.100]] 17:49, 7 February 2018 (UTC)
  
 
This comic is an illustration of the [[wikipedia:law of triviality|law of triviality]] aka the bike-shed effect. [[Special:Contributions/162.158.114.100|162.158.114.100]] 17:42, 7 February 2018 (UTC)
 
This comic is an illustration of the [[wikipedia:law of triviality|law of triviality]] aka the bike-shed effect. [[Special:Contributions/162.158.114.100|162.158.114.100]] 17:42, 7 February 2018 (UTC)

Revision as of 17:49, 7 February 2018

Great, now I can't decide how to write the transcript 108.162.216.40 15:00, 7 February 2018 (UTC)

And I now want a new backpack. I'm fine with the one I have, but *I want a new one dammit!* But I can't decide which one Jdluk (talk) 15:08, 7 February 2018 (UTC)

The knapsack optimization problem is famous for being NP-hard (Knapsack problem). Seems to be an allusion to it. Sebastian --162.158.91.191 15:53, 7 February 2018 (UTC)

Nope, see below. The knapsack problem is about optimizing the amount of stuff put into something, while Cueball goes through a buying decision process. 162.158.114.100 17:49, 7 February 2018 (UTC)

This comic is an illustration of the law of triviality aka the bike-shed effect. 162.158.114.100 17:42, 7 February 2018 (UTC)