Noncomputability, Unpredictability, Undecidability, and Unsolvability in Economic and Finance Theories

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]
Copy

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.


picture_as_pdf
Complexity_AAM_Ragu (2).pdf
subject
Accepted Version
Available under Creative Commons: Attribution-NonCommercial 3.0

View Download

Atom BibTeX OpenURL ContextObject in Span OpenURL ContextObject Dublin Core Dublin Core MPEG-21 DIDL Data Cite XML EndNote HTML Citation METS MODS RIOXX2 XML Reference Manager Refer ASCII Citation
Export

Downloads