The computable enumerations of families of general recursive functions
- 1 September 1972
- journal article
- Published by Springer Nature in Algebra and Logic
- Vol. 11 (5) , 326-336
- https://doi.org/10.1007/bf02330746
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- On the cardinality of the upper semilattice of computable enumerationsAlgebra and Logic, 1971