Advanced Computational Complexity Theory from an Elementary Standpoint
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-deterministric computations, completeness, reducibility and verifiability - all three of the latter concepts had their origins on what may be called 'Post's Program for Research for Higher Recursion Theory'. 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:||2007|
|Contact details of provider:|| Postal: |
Phone: +353-91 524411 ext. 2501
Fax: +353-91 524130
Web page: http://economics.nuigalway.ie
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:nig:wpaper:0125. 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: (Srinivas Raghavendra)
If references are entirely missing, you can add them using this form.