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.
Titolo: | Noncomputability, unpredictability, undecidability, and unsolvability in economic and finance theories |
Autori: | Ying Fang, Kao; V., Ragupathy; Velupillai, Kumaraswamy; Zambelli, Stefano |
Autori Unitn: | |
Titolo del periodico: | COMPLEXITY |
Anno di pubblicazione: | 2012 |
Numero e parte del fascicolo: | Issue 1 |
Codice identificativo Scopus: | 2-s2.0-84866161171 |
Codice identificativo ISI: | WOS:000308640200006 |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1002/cplx.21410 |
Handle: | http://hdl.handle.net/11572/93468 |
Appare nelle tipologie: | 03.1 Articolo su rivista (Journal article) |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione