On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
DOI10.1016/0165-4896(92)90060-IzbMath0767.03024OpenAlexW1970903680MaRDI QIDQ1196206
Publication date: 16 December 1992
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0165-4896(92)90060-i
Church's thesisbounded rationalityTuring degrees of unsolvabilityKleene-Mostowski hierarchydegrees of complexity for recursively presented Walrasian models of general equilibriumrealizable choice functions
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) General equilibrium theory (91B50) Recursively (computably) enumerable sets and degrees (03D25) Decision theory for games (91A35)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On effectively computable realizations of choice functions
- The minimum degree of recursively representable choice functions
- The complexity of economic decision rules
- Initial segments of the degrees of unsolvability
- On degrees of unsolvability
- Degrees of Unsolvability: A Tutorial
- Complexity of games and bounded rationality
- Degrees of Computability
- Classes of Predictably Computable Functions
- Decision Problems of Finite Automata Design and Related Arithmetics
- Recursive constructions in topological spaces
- Recursive real numbers
- Effective operations in a general setting
- Recursive metric spaces
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Equilibrium points in n -person games
- Existence of an Equilibrium for a Competitive Economy
- Recursive Real Numbers
