Noncomputability, unpredictability, undecidability, and unsolvability in economic and finance theories

Authors:
Ying-Fang Kao;V. Ragupathy;K. Vela Velupillai;Stefano Zambelli
Affiliations:
Algorithmic Social Sciences Research Unit (ASSRU), Department of Economics, University of Trento, 381 22 Trento, Italy;Algorithmic Social Sciences Research Unit (ASSRU), Department of Economics, University of Trento, 381 22 Trento, Italy;Algorithmic Social Sciences Research Unit (ASSRU), Department of Economics, University of Trento, 381 22 Trento, Italy;Algorithmic Social Sciences Research Unit (ASSRU), Department of Economics, University of Trento, 381 22 Trento, Italy
Venue:
Complexity
Year:
2012

Citing 3
Cited 0

Computable analysis: an introduction

Computable analysis: an introduction
Human Problem Solving

Human Problem Solving
Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. © 2012 Wiley Periodicals, Inc. Complexity, 2012 © 2012 Wiley Periodicals, Inc.