✦ LIBER ✦
DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY
✍ Scribed by Robert E. Byerly
- Publisher
- John Wiley and Sons
- Year
- 1984
- Tongue
- English
- Weight
- 330 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.