Can economic systems be seen as computing devices?

Journal of Economic Behavior and Organization

Volumn 70, Issue 1-2, 2009, Pages 72-80

  Bartholo, R S ^a   Cosenza, C A N ^a   Doria, F A ^a   de Lessa, C T R ^a  

^a PIT   (Brazil)

Author keywords

Axiomatics for economics; Goedel; Incompleteness; Market equilibrium; Nash game; Undecidability

Indexed keywords

EID: 64549121961     PISSN: 01672681     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jebo.2008.10.011     Document Type: Article

References (37)

1. Allen R.G.D. Macro-Economic Theory (1968), McMillan, London
2. Carnielli, W.A., Doria, F.A., 2008. Is computer science logic-dependent? In: Dégremont, C., et al. (Eds.), Dialogues, Logics and other Strange Things: Essays in Honor of Shahid Rahman, College Publications.
3. da Costa N.C.A., and Doria F.A. Computing the Future. In: Velupillai K.V. (Ed). Computability, Complexity and Constructivity in Economic Analysis (2005), Blackwell, Oxford 15-50
4. da Costa, N.C.A., Doria, F.A., in press. Hypotheses that imply the independence of P = N P from strong axiomatic systems. In: Zambelli, S. (Ed.), Festschrift in Honor of V. Velupillai, Routledge, London.
5. da Costa N.C.A., Doria F.A., and Bir E. On the metamathematics of the P v s N P question. Applied Mathematics and Computation 189 (2007) 1223-1240
6. Doria, F.A., Costa, J.F., eds., 2006. Special issue on hypercomputation. Applied Mathematics and Computation 178.
7. Koppl R. Thinking impossible things: a review essay. Journal of Economic Behavior and Organization 66 (2007) 837-847
8. Kreisel G. A notion of mechanistic theory. Synthèse 29 (1974) 11-26
9. Lewis, A.A., 1991. On the effective content of asymptotic verifications of Edgeworth's conjecture. Preprint, University of California at Irvine.
10. Lewis A.A. On Turing degrees of Walrasian models and a general impossibility result in the theory of decision making. Mathematical Social Sciences 24 (1992) 141-171
11. Lewis A.A. Some aspects of constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games. Mathematical Social Sciences 24 (1992) 209-235
12. Machtey M., and Young P. An Introduction to the General Theory of Algorithms (1979), North-Holland, Amsterdam
13. North, D., 1993. Nobel Prize Address. Nobel Prize site on the web.
14. Perrone A., and Ferraris G. Intelligent vs. random beavers. Metroeconomica 55 (2004) 332-344
15. Polányi K. The Great Transformation (1957), Beacon Press, Boston
16. Prasad K. Computability and randomness of Nash equilibria in infinite games. Journal of Mathematical Economics 20 (1991) 429-449
17. Prasad K. Constructive and classical models for results in economics and game theory. Metroeconomica 55 (2004) 141-154
18. Radó T. On non-computable functions. Bell Systems Technical Journal 41 (1962) 877-884
19. Rice H.G. Classes of recursively enumerable sets and their decision problems. Transactions on American Mathematical Society 74 (1953) 358-366
20. Richardson D. Some unsolvable problems involving elementary functions of a real variable. Journal of Symbolic Logic 33 (1968) 514-522
21. Rogers Jr. H. Theory of Recursive Functions and Effective Computability (1967), McGraw-Hill, New York
22. Rosser, Jr., J.B., 2006. Computational and dynamic complexity in economics. Preprint.
23. Scarpellini B. Two undecidable problems of analysis (translation from the 1963 original text). Minds and Machines 13 (2003) 49-77
24. Scarpellini B. Comments on 'Two undecidable problems of analysis'. Minds and Machines 13 (2003) 79-85
25. Shannon, C.E., 1948. A mathematical theory of communication, Bell System Technical Journal 27, 379-423 and 623-656.
26. Tsuji M., da Costa N.C.A., and Doria F.A. The incompleteness of theories of games. Journal of Philosophical Logic 27 (1998) 553-564
27. Turing A.M. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 50 (1936) 230-251
28. Velupillai K.V. Computable Economics (2000), Oxford University Press, Oxford
29. Velupillai, K.V., 2003a. Economics and the complexity vision. Discussion paper no. 7, Dipartimento di Economia, Università degli Studi di Trento.
30. Velupillai, K.V., 2003b. Essays on computable economics, methodology and the philosophy of science. Discussion paper no. 8, Dipartimento di Economia, Università degli Studi di Trento.
31. Velupillai, K.V. (Ed.), 2005. Computability, Complexity and Constructivity in Economic Analysis. Blackwell, Oxford.
32. Velupillai K.V. The unreasonable ineffectiveness of mathematics in economics. Cambridge Journal of Economics 29 (2005) 848-872
33. Velupillai K.V. Algorithmic foundations of computable general equilibrium theory. Applied Mathematics and Computation 179 (2006) 360-369
34. Velupillai, K.V., 2007a. Variations on the theme of conning in mathematical economics. Preprint.
35. K.V. Velupillai, 2007b. Sraffa's mathematical economics - a constructive interpretation. Preprint.
36. Zambelli S. Production of ideas by means of ideas: a Turing machine metaphor. Metroeconomica 55 (2004) 155-179
37. Zambelli G. Computable knowledge and undecidability. Workshop on Computable Economics: Lecture Notes (2005), Department of Economics, NUI Galway