Computable Economics: Reconstructing The Nonconstructive
In this paper, a case for Velupillai's Computable Economics is made. It is claimed that the methodological approach and results (theorems) of classical recursion theory and constructive mathematics should be at the foundation of theorizing in economics. The major point is that Turing machine equivalent computations set an upper bound to rational choice that cannot be circumvented with a non-rigorous and teleological "as if" assumption. Clearly, given that the optimal choices are almost always not constructible the paradigm of rational behavior as optimizing behavior is deprived of any practical, operational or theoretical meaning. It is Computable Economics that provides the proper foundation for a formally rigorous and meaningful definition of rationality.
Volume (Year): 08 (2012)
Issue (Month): 01 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/nmnc/nmnc.shtml|
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:wsi:nmncxx:v:08:y:2012:i:01:p:113-122. 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: (Tai Tone Lim)
If references are entirely missing, you can add them using this form.