Rudimentary Predicates and Relative Computation
- 1 May 1978
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 7 (2), 194-209
- https://doi.org/10.1137/0207018
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- The Hardest Context-Free LanguageSIAM Journal on Computing, 1973
- On two-way multihead automataJournal of Computer and System Sciences, 1973
- Language recognition by marking automataInformation and Control, 1972
- Tape-bounded turing acceptors and principal AFLsJournal of Computer and System Sciences, 1970
- Time- and tape-bounded turing acceptors and AFLsJournal of Computer and System Sciences, 1970
- What makes some language theory problems undecidableJournal of Computer and System Sciences, 1970
- Quasi-realtime languagesTheory of Computing Systems, 1970
- Context-free languages and rudimentary attributesTheory of Computing Systems, 1969
- Classes of predictably computable functionsTransactions of the American Mathematical Society, 1963