Reconstructing a Computable and Computationally Complex Theoretic Path Towards Simon's Behavioural Economics
This paper aims to interpret and formalize Herbert Simon's notions of bounded rationality, satisficing and heuristics in terms of computability theory and computational complexity theory. Simon's theory of human problem solving is analysed in the light of Turing's work on Solvable and Unsolvable Problems. It is suggested here that bounded rationality results from the fact that the deliberations required for searching computationally complex spaces exceed the actual complexity that human beings can handle. The immediate consequence is that satisficing becomes the general criterion of decision makers and heuristics are the procedures used for achieving their goals. In such decision problems, it is demonstrated that bounded rationality and satisficing are more general than Olympian rationality and optimization, respectively, and not the other way about.
|Date of creation:||2012|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.assru.economia.unitn.it/index.html
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Kumaraswamy Velupillai, . "The Computable Approach to Economics," Working Papers _005, University of California at Los Angeles, Center for Computable Economics.
- Selda (Ying Fang) Kao & K. Vela Velupillai, 2011. "Behavioural Economics: Classical and Modern," ASSRU Discussion Papers 1126, ASSRU - Algorithmic Social Science Research Unit.
When requesting a correction, please mention this item's handle: RePEc:trn:utwpas:1222. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (firstname.lastname@example.org)
If references are entirely missing, you can add them using this form.