Computable Foundations for Economics is a unified collection of essays, some of which are published here for the first time and all of which have been updated for this book, on an approach to economic theory from the point of view of algorithmic mathematics. By algorithmic mathematics the author means computability theory and constructive mathematics. This is in contrast to orthodox mathematical economics and game theory, which are formalised with the mathematics of real analysis, underpinned by what is called the ZFC formalism, i.e., set theory with the axiom of choice. This reliance on ordinary real analysis and the ZFC system makes economic theory in its current mathematical mode completely non-algorithmic, which means it is numerically meaningless. The book provides a systematic attempt to dissect and expose the non-algorithmic content of orthodox mathematical economics and game theory and suggests a reformalization on the basis of a strictly rigorous algorithmic mathematics. This removes the current schizophrenia in mathematical economics and game theory, where theory is entirely divorced from algorithmic applicability – for experimental and computational exercises. The chapters demonstrate the uncomputability and non-constructivity of core areas of general equilibrium theory, game theory and recursive macroeconomics. The book also provides a fresh look at the kind of behavioural economics that lies behind Herbert Simon’s work, and resurrects a role for the noble classical traditions of induction and verification, viewed and formalised, now, algorithmically. It will therefore be of particular interest to postgraduate students and researchers in algorithmic economics, game theory and classical behavioural economics.

Computable Foundations for Economics is a unified collection of essays, some of which are published here for the first time and all of which have been updated for this book, on an approach to economic theory from the point of view of algorithmic mathematics. By algorithmic mathematics the author means computability theory and constructive mathematics. This is in contrast to orthodox mathematical economics and game theory, which are formalised with the mathematics of real analysis, underpinned by what is called the ZFC formalism, i.e., set theory with the axiom of choice. This reliance on ordinary real analysis and the ZFC system makes economic theory in its current mathematical mode completely non-algorithmic, which means it is numerically meaningless. The book provides a systematic attempt to dissect and expose the non-algorithmic content of orthodox mathematical economics and game theory and suggests a reformalization on the basis of a strictly rigorous algorithmic mathematics. This removes the current schizophrenia in mathematical economics and game theory, where theory is entirely divorced from algorithmic applicability – for experimental and computational exercises. The chapters demonstrate the uncomputability and non-constructivity of core areas of general equilibrium theory, game theory and recursive macroeconomics. The book also provides a fresh look at the kind of behavioural economics that lies behind Herbert Simon’s work, and resurrects a role for the noble classical traditions of induction and verification, viewed and formalised, now, algorithmically. It will therefore be of particular interest to postgraduate students and researchers in algorithmic economics, game theory and classical behavioural economics.

This book explores an alternative approach to the conventional, market-based, view of economic theory and economic policy, at theoretical, numerical and applicable levels. The chapters provide a theoretical, empirical, and algorithmic approach to marcodynamics, Sraffian economics, and current policy issues. Post-Keynesian macroeconomics, business cycle theory, the trade cycle, microfoundations, and the Philips Machine are also covered. This book aims to challenge orthodox ideas and provide a lens through which to honour the work of Stefano Zambelli. It will be of relevant to students and academics interested in economics.

In 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 behavior, arithmetical games, aspects of production theory, and economic dynamics are given recursion theoretic (i.e. computable) interpretations.

This book presents a survey of the aspects of economic complexity, with a focus on foundational, interdisciplinary ideas. The long-awaited follow up to his 2011 volume Complex Evolutionary Dynamics in Urban-Regional and Ecologic-Economic Systems: From Catastrophe to Chaos and Beyond, this volume draws together the threads of Rosser’s earlier work on complexity theory and its wide applications in economics and an expanded list of related disciplines. The book begins with a full account of the broader categories of complexity in economics--dynamic, computational, hierarchical, and structural--before shifting to more detailed analysis. The next two chapters address problems associated with computational complexity, especially those of computability, and discuss the Godel Incompleteness Theorem with a focus on reflexivity. The middle chapters discuss the relationship between entropy, econophysics, evolution, and economic complexity, respectively, with applications in urban and regional dynamics, ecological economics, general equilibrium theory, as well as financial market dynamics. The final chapter works to bring together these themes into a broader framework and expose some of the limits concerning analysis of deeper foundational issues. With applications in all disciplines characterized by interconnected nonlinear adaptive systems, this book is appropriate for graduate students, professors and practitioners in economics and related disciplines such as regional science, mathematics, physics, biology, environmental sciences, philosophy, and psychology.

The book contains thirty original articles dealing with important aspects of theoretical as well as applied economic theory. While the principal focus is on: the computational and algorithmic nature of economic dynamics; individual as well as collective decision process and rational behavior, some contributions emphasize also the importance of classical recursion theory and constructive mathematics for dynamical systems, business cycles theories, growth theories, and others are in the area of history of thought, methodology and behavioural economics. The contributors range from Nobel Laureates to the promising new generation of innovative thinkers. This volume is also a Festschrift in honour of Professor Kumaraswamy Vela Velupillai, the founder of Computable Economics, a growing field of research where important results stemming from classical recursion theory and constructive mathematics are applied to economic theory. The aim and hope is to provide new tools for economic modelling. This book will be of particular appeal to postgraduate students and scholars in one or more of the following fields: computable economics, business cycles, macroeconomics, growth theories, methodology, behavioural economics, financial economics, experimental and agent based economics. It might be also of importance to those interested on the general theme of algorithmic foundations for social sciences.

The Oxford Handbook of Computational Economics and Finance provides a survey of both the foundations of and recent advances in the frontiers of analysis and action. It is both historically and interdisciplinarily rich and also tightly connected to the rise of digital society. It begins with the conventional view of computational economics, including recent algorithmic development in computing rational expectations, volatility, and general equilibrium. It then moves from traditional computing in economics and finance to recent developments in natural computing, including applications of nature-inspired intelligence, genetic programming, swarm intelligence, and fuzzy logic. Also examined are recent developments of network and agent-based computing in economics. How these approaches are applied is examined in chapters on such subjects as trading robots and automated markets. The last part deals with the epistemology of simulation in its trinity form with the integration of simulation, computation, and dynamics. Distinctive is the focus on natural computationalism and the examination of the implications of intelligent machines for the future of computational economics and finance. Not merely individual robots, but whole integrated systems are extending their "immigration" to the world of Homo sapiens, or symbiogenesis.

Drawing on an interdisciplinary panel of contributors, this book presents a stimulating dialogue between economics and art theory and considers how this might aid our understanding of both areas of research. The collection explores themes which both fields share, including rationality, abstraction and model building, the nature of social reality, representation and transformation. The contributions employ a broad range of methods to investigate the links between economics and art, and their coverage includes architecture, history of ideas, art theory, literature studies and beyond. This innovative volume will be of interest to advanced students and scholars of economic theory, cultural economics, literary and art theory and it intends to be a starting point for new avenues of interdisciplinary research.

Kurt Gödel (1906-1978) was an Austrian-American mathematician, who is best known for his incompleteness theorems. He was the greatest mathematical logician of the 20th century, with his contributions extending to Einstein’s general relativity, as he proved that Einstein’s theory allows for time machines. The Gödel incompleteness theorem - the usual formal mathematical systems cannot prove nor disprove all true mathematical sentences - is frequently presented in textbooks as something that happens in the rarefied realms of mathematical logic, and that has nothing to do with the real world. Practice shows the contrary though; one can demonstrate the validity of the phenomenon in various areas, ranging from chaos theory and physics to economics and even ecology. In this lively treatise, based on Chaitin’s groundbreaking work and on the da Costa-Doria results in physics, ecology, economics and computer science, the authors show that the Gödel incompleteness phenomenon can directly bear on the practice of science and perhaps on our everyday life.This accessible book gives a new, detailed and elementary explanation of the Gödel incompleteness theorems and presents the Chaitin results and their relation to the da Costa-Doria results, which are given in full, but with no technicalities. Besides theory, the historical report and personal stories about the main character and on this book’s writing process, make it appealing leisure reading for those interested in mathematics, logic, physics, philosophy and computer sciences.

This volume, with a foreword by Sir Roger Penrose, discusses the foundations of computation in relation to nature.It focuses on two main questions: What is computation? How does nature compute?The contributors are world-renowned experts who have helped shape a cutting-edge computational understanding of the universe. They discuss computation in the world from a variety of perspectives, ranging from foundational concepts to pragmatic models to ontological conceptions and philosophical implications.The volume provides a state-of-the-art collection of technical papers and non-technical essays, representing a field that assumes information and computation to be key in understanding and explaining the basic structure underpinning physical reality. It also includes a new edition of Konrad Zuse''s OC Calculating SpaceOCO (the MIT translation), and a panel discussion transcription on the topic, featuring worldwide experts in quantum mechanics, physics, cognition, computation and algorithmic complexity.The volume is dedicated to the memory of Alan M Turing OCo the inventor of universal computation, on the 100th anniversary of his birth, and is part of the Turing Centenary celebrations.