Universal computable enumerations of finite classes of families of total functions

DOI10.3103/S1066369X16120112zbMath1420.03091OpenAlexW2550303746MaRDI QIDQ2363401

M. Kh. Faizrakhmanov

Publication date: 19 July 2017

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x16120112

zbMATH Keywords

computable enumerationuniversal enumerationarithmetical enumerationclass of families

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

Unnamed Item

Cites Work

• A hierarchy of classes of families and \(n\)-low degrees
• Generalized computable universal numberings
• The enumeration spectrum hierarchy ofn-families
• Elementary Theories for Rogers Semilattices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Universal computable enumerations of finite classes of families of total functions