Computable Economics: The Arne Ryde Memorial Lectures
AbstractIn the field of economic analysis, computability in the formation of economic hypotheses is seen as the way forward. In this book, Professor Velupillai implements a theoretical research program along these lines. Choice theory, learning rational expectations equlibria, the persistence of adaptive behaviour, arithmetical games, aspects of production theory, and economic dynamics are given recursion theoretic (i.e. computable) interpretations. These interpretations lead to new kinds of questions being posed by the economic theorist. In particular, recurison theoretic decision problems replace standard optimisation paradigms in economic analysis. Economic theoretic questions, posed recursion-theoretically, lead to answers that are ambiguous: undecidable choices, uncomputable learning processes, and algorithmically unplayable games become standard answers. Professor Velupillai argues that a recursion theoretic formalisation of economic analysisComputable Economicsmakes the subject intrinsically inductive and computational. Available in OSO: http://www.oxfordscholarship.com/oso/public/content/economicsfinance/0198295278/toc.html
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoThis book is provided by Oxford University Press in its series OUP Catalogue with number 9780198295273 and published in 2000.
Contact details of provider:
Web page: http://www.oup.com/
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Edward W. Piotrowski & Jan Sladkowski, . "Quantum Game Theory in Finance," Departmental Working Papers 19, University of Bialtystok, Department of Theoretical Physics.
- Prasad, Kislaya, 2009. "The rationality/computability trade-off in finite games," Journal of Economic Behavior & Organization, Elsevier, vol. 69(1), pages 17-26, January.
- Francesco Luna, . "Computable Learning, Neural Networks and Institutions," Computing in Economics and Finance 1996 _037, Society for Computational Economics.
- Edward W. Piotrowski & Jan Sladkowski, . "Trading by Quantum Rules - Quantum Anthropic Principle," Departmental Working Papers 9, University of Bialtystok, Department of Theoretical Physics.
- Edward W. Piotrowski & Jan Sladkowski, . "The Next Stage: Quantum Game Theory," Departmental Working Papers 18, University of Bialtystok, Department of Theoretical Physics.
- Guglielmo Chiodi, 2012. "On Richard Goodwin’s Elementary Economics from the Higher Standpoint," ASSRU Discussion Papers 1219, ASSRU - Algorithmic Social Science Research Unit.
- K. Vela Velupillai & Stefano Zambelli, 2012. "Computability and Algorithmic Complexity in Economics," ASSRU Discussion Papers 1202, ASSRU - Algorithmic Social Science Research Unit.
- John Foster, 2005.
"From simplistic to complex systems in economics,"
Cambridge Journal of Economics,
Oxford University Press, vol. 29(6), pages 873-892, November.
- Holm, Hakan J., 2007. "Markets are more than Bits," Journal of Economic Behavior & Organization, Elsevier, vol. 63(2), pages 256-261, June.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Economics Book Marketing).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.