Expository notes on computability and complexity in (arithmetical) games

DOI10.1016/S0165-1889(97)00012-2zbMath0911.90379OpenAlexW2027114700MaRDI QIDQ1391661

Kumaraswamy Velupillai

Publication date: 22 July 1998

Published in: Journal of Economic Dynamics \& Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0165-1889(97)00012-2

zbMATH Keywords

complexitycomputabilityarithmetical gameseffective playability

Mathematics Subject Classification ID

Games involving topology, set theory, or logic (91A44) Microeconomic theory (price theory and economic markets) (91B24)

Related Items

A Model of Partnership Formation with Friction and Multiple Criteria ⋮ Uncomputability and undecidability in economic theory ⋮ Recasting Stefano Zambelli: Notes on the Foundations of Mathematics for a Post-Neoclassical Age in Economics ⋮ THE ROAD TAKEN (AND NOT TAKEN) IN THE MATHEMATIZATION OF ECONOMICS ⋮ COMPUTABLE ECONOMICS: RECONSTRUCTING THE NONCONSTRUCTIVE

Cites Work

• On effectively computable realizations of choice functions
• Three universal representations of recursively enumerable sets
• Learning Rational Expectations Under Computability Constraints
• Classification of Quantifier Prefixes Over Diophantine Equations
• Recursive Undecidability--An Exposition
• On Non-Computable Functions
• Computer Studies of Turing Machine Problems
• Recursively enumerable sets of positive integers and their decision problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item