PREDICTABLY COMPUTABLE FUNCTIONALS AND DEFINITION BY RECURSION
- 1 January 1964
- journal article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 10 (5) , 65-80
- https://doi.org/10.1002/malq.19640100502
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Classes of predictably computable functionsTransactions of the American Mathematical Society, 1963
- THE ABSTRACT THEORY OF AUTOMATARussian Mathematical Surveys, 1961
- Computable functionalsFundamenta Mathematicae, 1955
- Ordinal recursionMathematical Proceedings of the Cambridge Philosophical Society, 1953