Computable numberings to which noncomputable numberings are positively reducible

DOI10.1007/BF01137436MaRDI QIDQ1109027zbMATH OpenOpenAlexFDO

Authors 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)

Review text

See the review in Zbl 0638.03040.

Cited in

(2)

• scientific article; zbMATH DE number 4145890 (Why is no real title available?)
• On \(p\)-reducibility of computable numerations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109027)