Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE ( © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 04 December 2020

Abstract and Keywords

After a brief review of natural computationalism, this introductory chapter presents a new skeleton of computational economics and finance (CEF) along with an overview of the handbook. It begins with a conventional pursuit focusing on the algorithmic or numerical aspect of CEF such as computational efforts devoted to rational expectations, (dynamic) general equilibrium, and volatility. It then moves toward an automata- or organism-based perspective of CEF, involving nature-inspired intelligence, algorithmic trading, automated markets, network- and agent-based computing, and neural computing. As an alternative way to introduce this novel skeleton, the chapter starts with a view of computation or computing, addressing what computational economics intends to compute and what kinds of economics make computation so hard, and then it turns to a view of computing systems in which the Walrasian kind of computational economics is replaced by the Wolframian kind due to computational irreducibility.

Keywords: natural computationalism, nature-inspired computing, natural computing, automata, analog computing, Fisher Machine, Phillips Machine, agent-based computing, computational intelligence, computational irreducibility

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.