COMPUTABLE AND DYNAMICAL SYSTEMS FOUNDATIONS OF BOUNDED RATIONALITY AND SATISFICING

Formally, the orthodox rational agent#s #Olympian# choices ([14], p.19) are made in a static framework. However, a formalization of consistent choice, underpinned by computability, suggests satisficing in a boundedly rational 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 within the framework of decision problems in the formal sense of metamathematics and mathematical logic which, in turn, is the natural way of formalizing the notion of Human Problem Solving in the Newell-Simon sense. Casting Simons insights and suggestions on boundedly rational, satisficing and adaptive choice in the formalisms of time computational complexity theory and algorithmic dynamics makes it possible to take some small first steps in the direction of a formal demonstration of this proposition. A more complete attempt would require the additional consideration of space computational complexity, which will be the next step in this research program. The latter consideration would allow one to go beyond the P NP conundrum and thereby justify the relative, implici