ARAN - Access to Research at NUI Galway

Advanced Computational Complexity Theory from an Elementary Standpoint

ARAN - Access to Research at NUI Galway

Show simple item record

dc.contributor.author Velupillai, K. Vela en
dc.date.accessioned 2010-05-07T13:16:26Z en
dc.date.available 2010-05-07T13:16:26Z en
dc.date.issued 2007 en
dc.identifier.citation Velupillai, K. V., (2007) "Advanced Computational Complexity Theory from an Elementary Standpoint" (Working Paper No. 0125) Department of Economics, National University of Ireland, Galway. en
dc.identifier.uri http://hdl.handle.net/10379/952 en
dc.description.abstract 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. en
dc.format application/pdf en
dc.language.iso en en
dc.publisher National University of Ireland, Galway en
dc.relation.ispartofseries working paers;0125 en
dc.subject Economics en
dc.subject.lcsh Computational complexity en
dc.title Advanced Computational Complexity Theory from an Elementary Standpoint en
dc.type Working Paper en
dc.description.peer-reviewed peer-reviewed en

Files in this item

This item appears in the following Collection(s)

Show simple item record