Reduction of computable and potentially comutable numerations

DOI10.1007/BF01450246zbMath0195.01801MaRDI QIDQ2539040

Vladimir A. Uspensky

Publication date: 1970

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (1)

Two theorems on minimal generalized computable numberings

Cites Work

• Gödel numberings of partial recursive functions
• Unnamed Item

This page was built for publication: Reduction of computable and potentially comutable numerations