Expository notes on computability and complexity in (arithmetical) games (Q1391661): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Kumaraswamy Velupillai / rank | |||
Property / author | |||
Property / author: Kumaraswamy Velupillai / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5732624 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3944542 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3998431 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4099541 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3274599 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3245633 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5184183 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5734003 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursive Undecidability--An Exposition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three universal representations of recursively enumerable sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classification of Quantifier Prefixes Over Diophantine Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5514145 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On effectively computable realizations of choice functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computer Studies of Turing Machine Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3245637 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Non-Computable Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3272922 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5534712 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Learning Rational Expectations Under Computability Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2782588 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0165-1889(97)00012-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2027114700 / rank | |||
Normal rank |
Latest revision as of 09:36, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Expository notes on computability and complexity in (arithmetical) games |
scientific article |
Statements
Expository notes on computability and complexity in (arithmetical) games (English)
0 references
22 July 1998
0 references
computability
0 references
complexity
0 references
arithmetical games
0 references
effective playability
0 references