Computability and algorithmic complexity in economics

DOI10.1142/9789814374309_0016zbMATH Open1257.91013OpenAlexW1602046065MaRDI QIDQ4907926FDOQ4907926

Authors: Stefano Zambelli, K. Vela Velupillai 

Publication date: 26 February 2013

Published in: A Computable Universe (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789814374309_0016

Recommendations

• Uncomputability and undecidability in economic theory
• Computability, complexity and constructivity in economic analysis.
• Computability, complexity and economics
• Computable economics. The Arne Ryde memorial lectures
• Computable economics: reconstructing the nonconstructive

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fundamental topics (basic mathematics, methodology; applicable to economics in general) (91B02) General topics in the theory of computing (68Q01)

Cited In (9)

• Introduction to computer science and economic theory
• Uncomputability and undecidability in economic theory
• Computation as economics
• Algorithmic economics: incomputability, undecidability and unsolvability in economics
• Computability, complexity and economics
• Recasting Stefano Zambelli: notes on the foundations of mathematics for a post-neoclassical age in economics
• Computation and Complexity in Economic Behavior and Organization
• Computable economics. The Arne Ryde memorial lectures
• Blueprint for an algorithmic economics

This page was built for publication: Computability and algorithmic complexity in economics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4907926)