Formally, the orthodox rational agent's ‘‘Olympian’’ choices, as Simon has called orthodox rational choice, are made in a static framework. However, a formalization of consistent choice, underpinned by computability, suggests by,satisficingin aboundedlyrational framework is not only more general than the model of ‘‘Olympian’’ rationality, it is also consistently dynamic. This kind of naturally process-oriented approach to the formalization of consistent choice can be interpreted and encapsulated withinthe framework ofdecision problems—in the formal sense ofmetamathematicsand mathematical logic—which, in turn, is the natural way of formalizing thenotion ofHuman Problem Solvingin the Newell-Simon sense.
展开▼
