Rationality, computability, and complexity (Q920814)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4164496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rationality, computability, and complexity |
scientific article; zbMATH DE number 4164496 |
Statements
Rationality, computability, and complexity (English)
0 references
1990
0 references
A definition of choice functions as (a subset of) computable functions is given. One implication is the representation of a 'rational economic agent' as a nondeterministic Turing Machine. A measure of rational behaviour can be obtained on the basis of algorithmic complexity of decision rules.
0 references
choice functions
0 references
computable functions
0 references
nondeterministic Turing Machine
0 references
measure of rational behaviour
0 references
0.8672388195991516
0 references
0.8386178016662598
0 references
0.8321998715400696
0 references
0.8263325691223145
0 references
0.8153892755508423
0 references
