Universal computable enumerations of finite classes of families of total functions
From MaRDI portal
(Redirected from Publication:2363401)
Recommendations
Cites work
- A hierarchy of classes of families and \(n\)-low degrees
- Elementary Theories for Rogers Semilattices
- Generalized computable numerations and nontrivial Rogers semilattices
- Generalized computable universal numberings
- scientific article; zbMATH DE number 2007861 (Why is no real title available?)
- scientific article; zbMATH DE number 2063214 (Why is no real title available?)
- The enumeration spectrum hierarchy of n-families
Cited in
(6)- scientific article; zbMATH DE number 4094815 (Why is no real title available?)
- Effective Enumerations of Families of Finite Sets of Natural Numbers
- Iterative Characterizations of Computable Unary Functions: A General Method
- scientific article; zbMATH DE number 2077145 (Why is no real title available?)
- scientific article; zbMATH DE number 871851 (Why is no real title available?)
- scientific article; zbMATH DE number 7763258 (Why is no real title available?)
This page was built for publication: Universal computable enumerations of finite classes of families of total functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363401)