✦ LIBER ✦

Polynomial Computability of Certain Rudimentary Predicates

✍ Scribed by S. S. Marchenkov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Examples of predicates inexpressible by

✍ V. A. Nepomnyashchii 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 352 KB

Computability of certain classes of cons

✍ V. P. Dobritsa 📂 Article 📅 1978 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 716 KB

Rudimentary interpretation of two-tape t

✍ V. A. Nepomnyashehii 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 577 KB

Automorphism Groups of Computably Enumer

✍ E.F. Combarro 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 224 KB

A certain property of polynomials

✍ K. Ozeki 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 172 KB

A certain property of polynomials

✍ K. Ozeki 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 96 KB