A Computable Economist’s Perspective on Computational Complexity
AbstractA computable economist.s view of the world of computational complexity theory is described. This means the model of computation underpinning theories of computational complexity plays a central role. The emergence of computational complexity theories from diverse traditions is emphasised. The unifications that emerged in the modern era was codified by means of the notions of efficiency of computations, non-deterministic computations, completeness, reducibility and verifiability - all three of the latter concepts had their origins on what may be called "Post's Program of Research for Higher Recursion Theory". Approximations, computations and constructions are also emphasised. The recent real model of computation as a basis for studying computational complexity in the domain of the reals is also presented and discussed, albeit critically. A brief sceptical section on algorithmic complexity theory is included in an appendix.
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 Department of Economics, University of Trento, Italia in its series Department of Economics Working Papers with number 0723.
Date of creation: 2007
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-ALL-2007-10-13 (All new papers)
- NEP-CBE-2007-10-13 (Cognitive & Behavioural Economics)
- NEP-CMP-2007-10-13 (Computational Economics)
- NEP-HPE-2007-10-13 (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.:
- K. Vela Velupillai, 2004. "Economic Dynamics and Computation-Resurrecting the Icarus Tradition," Metroeconomica, Wiley Blackwell, vol. 55(2-3), pages 239-264, 05.
- R. S. Bartholo & C. A. Cosenza & F. A. Doria & M. Doria & A. Teixeira, 2011. "On Exact and Approximate Solutions for Hard Problems: An Alternative Look," ASSRU Discussion Papers 1103, ASSRU - Algorithmic Social Science Research Unit.
- K. Vela Velupillai, 2008. "Uncomputability and Undecidability in Economic Theory," Department of Economics Working Papers 0806, Department of Economics, University of Trento, Italia.
- David Colander & Richard P.F. Holt & J. Barkley Rosser, 2010.
"The Complexity Era in Economics,"
Middlebury College Working Paper Series
1001, Middlebury College, Department of Economics.
- K. Vela Velupillai, 2011. "Remembering Clower," ASSRU Discussion Papers 1121, ASSRU - Algorithmic Social Science Research Unit.
- K. Vela Velupillai, 2011. "Computable and Dynamical Systems Foundations of Bounded Rationality and Satisficing," ASSRU Discussion Papers 1116, ASSRU - Algorithmic Social Science Research Unit.
- K.Vela Velupillai, 2012. "The Epistemology of Simulation, Computation and Dynamics in Economics," ASSRU Discussion Papers 1218, ASSRU - Algorithmic Social Science Research Unit.
- Selda (Ying Fang) Kao & K. Vela Velupillai, 2011. "Behavioural Economics: Classical and Modern," ASSRU Discussion Papers 1126, ASSRU - Algorithmic Social Science Research Unit.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Luciano Andreozzi).
If references are entirely missing, you can add them using this form.