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

Authors

  • Ying-Fang Kao,

    1. Algorithmic Social Sciences Research Unit (ASSRU), Department of Economics, University of Trento, 381 22 Trento, Italy
    Search for more papers by this author
  • V. Ragupathy,

    Corresponding author
    1. 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
    Search for more papers by this author
  • K. Vela Velupillai,

    1. Algorithmic Social Sciences Research Unit (ASSRU), Department of Economics, University of Trento, 381 22 Trento, Italy
    Search for more papers by this author
  • Stefano Zambelli

    1. Algorithmic Social Sciences Research Unit (ASSRU), Department of Economics, University of Trento, 381 22 Trento, Italy
    Search for more papers by this author

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

Ancillary