Recursion and complexity theory on CPO-S
- 9 June 2005
- book chapter
- Published by Springer Nature
- p. 195-202
- https://doi.org/10.1007/bfb0017311
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- When are two effectively given domains identical?Published by Springer Nature ,1979
- Effectively given domainsTheoretical Computer Science, 1977
- Computability concepts for programming language semanticsTheoretical Computer Science, 1976
- Theorie der Numerierungen IMathematical Logic Quarterly, 1973
- 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
- Nicht konstruktiv beweisbare Sätze der AnalysisThe Journal of Symbolic Logic, 1949