✦ LIBER ✦

Decidable Computable A-Numberings

✍ Scribed by V.G. Puzarenko

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two theorems on computable numberings

✍ V. L. Selivanov 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 623 KB

Computable numberings to which noncomput

✍ A. N. Degtev 📂 Article 📅 1987 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 235 KB

Some applications of computable one-one

✍ Martin Kummer 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 692 KB

Semi-effective numberings and definition

✍ Mayoh, B. H. 📂 Article 📅 1968 🏛 Springer-Verlag ⚖ 750 KB

Minimal Coverings in the Rogers Semilatt

✍ S. A. Badaev; S. Yu. Podzorov 📂 Article 📅 2002 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 210 KB

Computable Solutions of Equations over E

✍ E. F. Combarro 📂 Article 📅 2003 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 230 KB