scientific article; zbMATH DE number 4039878

MaRDI QIDQ3778737zbMATH OpenFDO

Authors A. N. Degtev

Publication date 1987

zbMATH Keywords

computable numerationcomputable set of recursively enumerable setstheory of numerations

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Positive numerations of families with one-valued numerations
• On p-reducibility of numerations
• Positive undecidable numberings in the Ershov hierarchy
• scientific article; zbMATH DE number 3557769
• Minimal numerations of positively computable families

Cited in

(4)

• All Functions $$g: \mathbb{N} \rightarrow \mathbb{N}$$ Which have a Single-Fold Diophantine Representation are Dominated by a Limit-Computable Function $$f: \mathbb{N}\setminus \{0\} \rightarrow \mathbb{N}$$ Which is Implemented in MuPAD and Whose Computability is an Open Problem
• scientific article; zbMATH DE number 3557769 (Why is no real title available?)
• On \(p\)-reducibility of computable numerations
• On p-reducibility of numerations

This page was built for publication:

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