Some notes on Church's thesis and the theory of games

DOI10.1007/BF00134103MaRDI QIDQ911776zbMATH OpenOpenAlexFDO

Authors Luca Anderlini

Publication date 1990

Published in Theory and Decision (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00134103

zbMATH Keywords

Church's thesisrecursive functionsrecursive setsknowledge operatornormal-form gamesrational playersset of rational playersTuring Machines

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Recommendations

• On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
• scientific article; zbMATH DE number 3887475
• Non-computable strategies and discounted repeated games
• Game-theoretic axioms for local rationality and bounded knowledge
• The incompleteness of theories of games

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3431764 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Belief, awareness, and limited reasoning
• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
• Cooperation in the prisoner's dilemma
• Finite automata play the repeated prisoner's dilemma
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi

Cited in

(14)

• The logical representation of extensive games
• Growth of strategy sets, entropy, and nonstationary bounded recall
• On the logic of common belief and common knowledge
• Cooperation and computability in \(n\)-player games
• Robust program equilibrium
• Forecasting errors and bounded rationality: An example
• Turing and the ontological dimension of games
• The Gödelian foundations of self-reference, the liar and incompleteness: arms race in complex strategic innovation
• Magic: The Gathering is Turing complete
• Communication, computability, and common interest games
• Bounded rationality, strategy simplification, and equilibrium
• On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
• Game theory and strategic complexity
• Non-computable rational expectations equilibria

This page was built for publication: Some notes on Church's thesis and the theory of games

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