The relevance of \textit{computation irreducibility} as \textit{computation universality} in economics

DOI10.1007/978-3-642-35482-3_9zbMATH Open1298.68187OpenAlexW1527613411MaRDI QIDQ2929344FDOQ2929344

Authors K. Vela Velupillai 

Publication date 12 November 2014

Published in Emergence, Complexity and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35482-3_9

zbMATH Keywords

computational equivalencecomputation universalitycomputational irreducibility

Mathematics Subject Classification ID

Mathematical economics (91B99) Cellular automata (computational aspects) (68Q80)

Recommendations

• Computability, complexity and constructivity in economic analysis.
• Computability, complexity and economics
• Foundations and applications of complexity economics
• On the role of computation in economic theory
• Emergence and Universal Computation

Cites work

• scientific article; zbMATH DE number 1818513 (Why is no real title available?)
• scientific article; zbMATH DE number 3900744 (Why is no real title available?)
• scientific article; zbMATH DE number 44033 (Why is no real title available?)
• scientific article; zbMATH DE number 44346 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• Computable economics. The Arne Ryde memorial lectures
• The nature of computation

Cited in

(2)

• Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics
• Uncomputability and undecidability in economic theory

This page was built for publication: The relevance of \textit{computation irreducibility} as \textit{computation universality} in economics

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