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

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 Graca's thought-provoking recent article. (c) 2012 Wiley Periodicals, Inc. Complexity, 2012