Why? Going back to proofs, it’s reasonable that there’s some optimal proof-finding algorithm given the set of proofs you want to solve (equivalent to knowing what social situations you will be in). But if you don’t know the problems, is there an efficient one-size fits all algorithm that isn’t basically “find the right algorithm in your situation and then execute it?” Does there have to be?
Why? Going back to proofs, it’s reasonable that there’s some optimal proof-finding algorithm given the set of proofs you want to solve (equivalent to knowing what social situations you will be in). But if you don’t know the problems, is there an efficient one-size fits all algorithm that isn’t basically “find the right algorithm in your situation and then execute it?” Does there have to be?