A Computable Economist’s Perspective on Computational Complexity
A 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.
|Date of creation:||2007|
|Date of revision:|
|Contact details of provider:|| Postal: Via Inama 5, 38100 Trento|
Web page: http://www.unitn.it/deco
More information through EDIRC
References listed on IDEAS
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.
When requesting a correction, please mention this item's handle: RePEc:trn:utwpde:0723. 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: (Luciano Andreozzi)
If references are entirely missing, you can add them using this form.