Kao, Ying-Fang; Venkatachalam, Ragupathy; Kumaraswamy, Velupillai Vela and Zambelli, Stefano. 2012. Noncomputability, Unpredictability, Undecidability, and Unsolvability in Economic and Finance Theories. Complexity, 18(1), pp. 51-55. ISSN 1076-2787 [Article]

Preview

Text Complexity_AAM_Ragu (2).pdf - Accepted Version Available under License Creative Commons Attribution Non-commercial. Download (339kB) | Preview

Abstract or Description

We outline, briefly, the role that issues of the nexus between noncomputability and unpredictability, on the one hand, and between undecidability and unsolvability, on the other hand, have played in Computable Economics (CE). The mathematical underpinnings of CE are provided by (classical) recursion theory, varieties of computable and constructive analysis and aspects of combinatorial optimization. The inspiration for this outline was provided by Professor Graça’s thought-provoking recent article.

Item Type:	Article
Identification Number (DOI):	https://doi.org/10.1002/cplx.21410
Departments, Centres and Research Units:	Institute of Management Studies Institute of Management Studies > Structural Economic Analysis
Dates:	Date Event 9 April 2012 Submitted 2 June 2012 Accepted
Item ID:	19485
Date Deposited:	18 Jan 2017 16:42
Last Modified:	26 Feb 2024 13:17
Peer Reviewed:	Yes, this version has been peer-reviewed.
URI:	https://research.gold.ac.uk/id/eprint/19485

View statistics for this item...

Edit Record (login required)