What are the gains of the theory of algorithms
Authors:
- V. A. UspenskyVUV. A. Uspensky
- A. L. SemenovA. L. Semenov
- 1 January 1981
- book chapter
- Published by Springer Nature
- p. 100-234
Abstract
No abstract availableThis publication has 84 references indexed in Scilit:
- Separating Nondeterministic Time Complexity ClassesJournal of the ACM, 1978
- General context-free recognition in less than cubic timeJournal of Computer and System Sciences, 1975
- Optimal enumerations and optimal gödel numberingsTheory of Computing Systems, 1974
- Nicht konstruktiv beweisbare Sätze der AnalysisThe Journal of Symbolic Logic, 1949
- Definability and decision problems in arithmeticThe Journal of Symbolic Logic, 1949
- Recursive Unsolvability of a problem of ThueThe Journal of Symbolic Logic, 1947
- Finite combinatory processes—formulationThe Journal of Symbolic Logic, 1936
- Zur Deutung der intuitionistischen LogikMathematische Zeitschrift, 1932
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme IMonatshefte für Mathematik, 1931
- Grundlagen der WahrscheinlichkeitsrechnungMathematische Zeitschrift, 1919