𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational complexity of recursively enumerable sets

✍ Scribed by Robert I. Soare


Book ID
114037606
Publisher
Elsevier Science
Year
1982
Weight
565 KB
Volume
52
Category
Article
ISSN
0019-9958

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Completely recursively enumerable sets
✍ Y. D. Korolβ€²kov πŸ“‚ Article πŸ“… 1999 πŸ› SP MAIK Nauka/Interperiodica 🌐 English βš– 615 KB
Recursively Enumerable L-Sets
✍ Loredana Biacino; Giangiacomo Gerla πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 405 KB