Über die Reduzierbarkeit berechenbarer Numerierungen

DOI10.1007/BF02219834zbMath0317.02043MaRDI QIDQ1221753

S. Singh

Publication date: 1970

Published in: Algebra and Logic (Search for Journal in Brave)

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99)

Related Items (2)

How much partiality is needed for a theory of computability? ⋮ Some applications of computable one-one numberings

Cites Work

• Unnamed Item
• Unnamed Item
• Three theorems on the degrees of recursively enumerable sets
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Degrees of Unsolvability. (AM-55)
• Godel Numberings Versus Friedberg Numberings

This page was built for publication: Über die Reduzierbarkeit berechenbarer Numerierungen