This is a preview of subscription content, log in via an institution to check access.
Literature Cited
R. M. Smyllyan, Theory of Formal Systems, Princeton (1961).
V. A. Nepomnyashchii, “Rudimentary interpretation of double-tape Turing computations,” Kibernetika, No. 2 (1970).
V. A. Nepomnyashchii, “Rudimentary predicates and Turing computations,” Dokl. Akad. Nauk SSSR,195, No. 2, 282–284 (1970).
N. D. Jones, “Context-free languages and rudimentary attributes,” Mathematical Systems Theory,3, No. 2, 102–109 (1969).
B. A. Trakhtenbrot, “Turing computations with logarithmic delay,” Algebra i Logika,3, No. 4, 33–48 (1964).
A. V. Kuznetsov, “On a theorem regarding a canonical form for ordinally recursive functions,” in: R. L. Gudstein (Ed.), Mathematical Logic [in Russian], Moscow (1961), Appendix, pp. 149–154.
W. J. Savitch, “Relationships between nondeterministic and deterministic tape complexities,” J. Computer and System Sci.,4, No. 2, 177–192 (1970).
J. E. Hopcroft and J. D. Ullman, “Relations between time and tape complexities,” J. Assoc. Computing Machinery,15, No. 3, 414–427 (1968).
R. V. Rich, “A class of representably computable functions,” Problems in Mathematical Logic [in Russian], BKS, Moscow (1970), pp. 50–93.
A. A. Letichevskii, “Presentation of context-free languages in automata with ‘push-down’ memory,” Kibernetika, No. 2, 80–84 (1965).
A. V. Akhou and J. D. Ullman, The Theory of Languages, Cybernetics Collection, New Series, No. 6 [in Russian], Moscow (1969), pp. 145–183.
Additional information
Translated from Kibernetika, No. 2, pp. 23–29, March–April, 1973.
Rights and permissions
About this article
Cite this article
Nepomnyashchii, V.A. Rudimentary modelling of indeterminate turing calculations. Cybern Syst Anal 9, 212–218 (1973). https://doi.org/10.1007/BF01069074
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069074