|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
9 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Analogues of semirecursive sets and effective reducibilities to the study of NP complexity |
Selman, Alan L. |
1982 |
52 | 1 |
p. 36-51 16 p. |
article |
|
| 2 | Busy beaver sets: Characterizations and applications |
Daley, Robert P. |
1982 |
52 | 1 |
p. 52-67 16 p. |
article |
|
| 3 | Computational complexity of recursively enumerable sets |
Soare, Robert I. |
1982 |
52 | 1 |
p. 8-18 11 p. |
article |
|
| 4 | Editorial Board |
1982 |
52 | 1 |
p. i- 1 p. |
article |
||
| 5 | Introduction |
Davis, Martin |
1982 |
52 | 1 |
p. 1- 1 p. |
article |
|
| 6 | On the recursion-theoretic complexity of relative succinctness of representations of languages |
Hay, Louise |
1982 |
52 | 1 |
p. 2-7 6 p. |
article |
|
| 7 | Tradeoffs in the inductive inference of nearly minimal size programs |
Chen, Keh-Jiann |
1982 |
52 | 1 |
p. 68-86 19 p. |
article |
|
| 8 | Universal automata with uniform bounds on simulation time |
Menzel, W. |
1982 |
52 | 1 |
p. 19-35 17 p. |
article |
|
| 9 | What is a model of the lambda calculus? |
Meyer, Albert R. |
1982 |
52 | 1 |
p. 87-122 36 p. |
article |
9 results found