Toward a theory of enumerations
- 1 October 1968
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02724847,p. 334-350
- https://doi.org/10.1109/swat.1968.37
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the Computational Complexity of AlgorithmsTransactions of the American Mathematical Society, 1965
- Effective operations in a general settingThe Journal of Symbolic Logic, 1964
- Classes of Predictably Computable FunctionsTransactions of the American Mathematical Society, 1963
- A Comparison of Five “Computable” OperatorsMathematical Logic Quarterly, 1960
- Gödel numberings of partial recursive functionsThe Journal of Symbolic Logic, 1958
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958
- Some theorems on classes of recursively enumerable setsTransactions of the American Mathematical Society, 1958
- On completely recursively enumerable classes and their key arraysThe Journal of Symbolic Logic, 1956
- Effective operations on partial recursive functionsMathematical Logic Quarterly, 1955
- Classes of recursively enumerable sets and their decision problemsTransactions of the American Mathematical Society, 1953