✦ LIBER ✦

e-Principal numberings

✍ Scribed by A. N. Dëgtev; M. L. Platonov

Book ID: 106530311
Publisher: SP MAIK Nauka/Interperiodica
Year: 2008
Tongue: English
Weight: 150 KB
Volume: 49
Category: Article
ISSN: 0037-4466
DOI: 10.1007/s11202-008-0024-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computable numberings to which noncomput

Computable numberings to which noncomputable numberings are positively reducible

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

Learning in Friedberg numberings

✍ Sanjay Jain; Frank Stephan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 262 KB

Decidable Computable A-Numberings

✍ V.G. Puzarenko 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 252 KB

Distributive lattices of numberings

✍ Z. G. Khisamiev 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 258 KB

Topological aspects of numberings

✍ Wolfram Menzel; Frank Stephan 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 330 KB

## Abstract We investigate connections between the syntactic and semantic distance of programs on an abstract, recursion theoretic level. For a certain rather restrictive notion of interdependency of the two kinds of distances, there remain only few and “unnatural” numberings allowing such close re

Two theorems on computable numberings

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