Computability Theory in Economics - Frontiers and a Restrospective
AbstractThis is an outline of the origins and development of the way computability theory was incorporated into formal economic theory. I try to place in the context of the development of computable economics, some of the classics of the subject as well as those that have, from time to time, been credited with having contributed to the advancement of the field. Speculative methodological thoughts and reflections suggest directions in which fruitful research could proceed to reduce the current deficit in the epistemology of computation in economics. Finally, thoughts on where the frontiers of computable economics are, and how to move towards them, conclude the paper. In a precise sense -- both historically and analytically -- it would not be an exaggeration to claim that both the origins of computable economics and its frontiers are defined by two classics, both by Banach and Mazur: that one page masterpiece by Banach and Mazur and the unpublished Mazur conjecture of 1928, and its unpublished proof by Banach. For the undisputed original classic of computable economics is Rabin's effectivization of the Gale-Stewart game; the frontiers, as I see them, are defined by recursive analysis and constructive mathematics, underpinning computability over the computable and constructive reals and providing computable foundations for the economist's Marshallian penchant for curve-sketching and, in general, the contents of Theoretical Computer Science, Vol. 219, Issue 1-2). The former work has its roots in the Banach-Mazur game, at least in one reading of it; the latter in Banach and Mazur (1937), as well as other, earlier, contributions, not least by Brouwer.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by ASSRU - Algorithmic Social Science Research Unit in its series ASSRU Discussion Papers with number 1302.
Date of creation: 2013
Date of revision:
Computability; Effectivization; Constructivity; Uncomputability; Computable Economics;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2013-09-26 (All new papers)
- NEP-CMP-2013-09-26 (Computational Economics)
- NEP-GTH-2013-09-26 (Game Theory)
- NEP-HME-2013-09-26 (Heterodox Microeconomics)
- NEP-HPE-2013-09-26 (History & Philosophy of Economics)
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.:
- Shoven,John B. & Whalley,John, 1992.
"Applying General Equilibrium,"
Cambridge University Press, number 9780521266550, December.
- Clower, Robert W & Howitt, Peter W, 1978. "The Transactions Theory of the Demand for Money: A Reconsideration," Journal of Political Economy, University of Chicago Press, vol. 86(3), pages 449-66, June.
- Martin J Osborne & Ariel Rubinstein, 2009.
"A Course in Game Theory,"
814577000000000225, UCLA Department of Economics.
- K. Vela Velupillai, 2011.
"Towards An Algorithmic Revolution In Economic Theory,"
Journal of Economic Surveys,
Wiley Blackwell, vol. 25(3), pages 401-430, 07.
- K. Vela Velupillai, 2011. "Towards an Algorithmic Revolution in Economic Theory," ASSRU Discussion Papers 1105, ASSRU - Algorithmic Social Science Research Unit.
- Warren Young, 2008. "Negishi's contributions to the development of economic analysis: Research programs and outcomes," International Journal of Economic Theory, The International Society for Economic Theory, vol. 4(2), pages 151-165.
- Smale, Stephen, 1976. "Dynamics in General Equilibrium Theory," American Economic Review, American Economic Association, vol. 66(2), pages 288-94, May.
- Takashi Negishi, 2008. "Unnoticed predecessors of the early Negishi theorems," International Journal of Economic Theory, The International Society for Economic Theory, vol. 4(2), pages 167-173.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (email@example.com).
If references are entirely missing, you can add them using this form.