Computable numberings to which noncomputable numberings are positively reducible

DOI10.1007/BF01137436zbMath0655.03031OpenAlexW2036604229MaRDI QIDQ1109027

A. N. Degtev

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1007/bf01137436

zbMATH Keywords

computable numerationcomputable set of recursively enumerable setstheory of numerations

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item

This page was built for publication: Computable numberings to which noncomputable numberings are positively reducible