Pseudo-extensions of computable functions
Open Access
- 28 February 1983
- journal article
- Published by Elsevier in Information and Control
- Vol. 56 (1-2) , 100-111
- https://doi.org/10.1016/s0019-9958(83)80052-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Honest bounds for complexity classes of recursive functionsThe Journal of Symbolic Logic, 1974
- On Effective Procedures for Speeding Up AlgorithmsJournal of the ACM, 1971
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- Gödel numberings of partial recursive functionsThe Journal of Symbolic Logic, 1958