Critical unresolved meta-questions about #DecisionMaking include computability, utility specification, and preference aggregation.
-
-
Replying to @MakerOfDecision
@MakerOfDecision isn't uncomputability of decision-making in general covered by reliance on Solomonoff induction?1 reply 0 retweets 0 likes -
Replying to @The_Lagrangian
@The_Lagrangian Ummm... If you don't mind that you are explicitly using an unusable formalism. (We can to find approximations computably)1 reply 0 retweets 0 likes -
Replying to @MakerOfDecision
@MakerOfDecision is the meta-question whether particular algorithms we have are c'ble, or whether there even exists a c'ble framework?1 reply 0 retweets 0 likes -
Replying to @The_Lagrangian
@The_Lagrangian Answer to MQ2, in general, is no - but in some limited cases, is yes. So MQ1 is: is the proposed algo computable here?1 reply 0 retweets 0 likes
@The_Lagrangian There are MANY questions where there is no exact polynomial time algo that works, so which approximate one should we use?
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.