Classes with pairwise equivalent enumerations

DOI10.1007/3-540-58140-5_14MaRDI QIDQ4501145zbMATH OpenFDO

Authors Serikzhan A. Badaev, S. S. Goncharov

Publication date 3 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58140-5_14

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25)

Cited in

(1)

• A learning-theoretic characterization of classes of recursive functions

This page was built for publication: Classes with pairwise equivalent enumerations

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