17 results
John E. Hopcroft and Jeffrey D. Ullman. Relations between time and tape complexities. Journal of the Association for Computing Machinery, vol. 15 (1968), pp. 414–427.
-
- Journal:
- The Journal of Symbolic Logic / Volume 38 / Issue 2 / June 1973
- Published online by Cambridge University Press:
- 12 March 2014, p. 343
- Print publication:
- June 1973
-
- Article
- Export citation
J. Hartmanis, P. M. LewisII, and R. E. Stearns. Classifications of computations by time and memory requirements. Information processing 1965, Proceedings of IFIP Congress 65, organized by the International Federation for Information Processing, New York City, May 24–29,1965, Volume 1, edited by Wayne A. Kalenich, Spartan Books, Inc., Washington, D.C., and Macmillan and Co., Ltd., London, 1965, pp. 31–35.
-
- Journal:
- The Journal of Symbolic Logic / Volume 37 / Issue 3 / September 1972
- Published online by Cambridge University Press:
- 12 March 2014, p. 624
- Print publication:
- September 1972
-
- Article
- Export citation
Robert R. Korfhage. Logic and algorithms with applications to the computer and information sciences. John Wiley & Sons, Inc., New York, London, and Sydney, 1966, xii + 194 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 36 / Issue 2 / June 1971
- Published online by Cambridge University Press:
- 12 March 2014, pp. 344-346
- Print publication:
- June 1971
-
- Article
- Export citation
B. A. Trahténbrot. Složnost algoritmov i vyčíslenij (Spéckurs dlá studéntov NGU)(Complexity of algorithms and computations (Special course for students of the Novosibirsk Government University)). Novosibirskij Gosudarstvénnyj Univérsitét, Novosibirsk1967, 258 pp., mimeographed.
-
- Journal:
- The Journal of Symbolic Logic / Volume 35 / Issue 2 / June 1970
- Published online by Cambridge University Press:
- 12 March 2014, pp. 337-339
- Print publication:
- June 1970
-
- Article
- Export citation
B. A. Trahténbrot. Optimal′nyé vyčísléniá i častotnoé ávlénié Åblonskogo (Optimal computations and the frequency occurrence of Áblonskij). Algébra i logika, Séminar, vol. 4 no. 5 (1965), pp. 79–93.
-
- Journal:
- The Journal of Symbolic Logic / Volume 34 / Issue 1 / 29 May 1969
- Published online by Cambridge University Press:
- 12 March 2014, p. 134
- Print publication:
- 29 May 1969
-
- Article
- Export citation
G. S. Matvééva. К téorémé Rabina o složnosti vyčislimyh funkcij (On a theorem of Rabin concerning the complexity of computable functions). Sibirskij matématičéskij žurnal, vol. 6 (1965), pp. 546–555.
-
- Journal:
- The Journal of Symbolic Logic / Volume 34 / Issue 1 / 29 May 1969
- Published online by Cambridge University Press:
- 12 March 2014, pp. 133-134
- Print publication:
- 29 May 1969
-
- Article
- Export citation
B. A. Trahténbrot. T′úringovy vyčisléniá s logarifmičéskim zamédléniém (Turing computations with logarithmic delay). Algébra i logika, Séminar, vol. 3 no. 4 (1964), pp. 33–48.
-
- Journal:
- The Journal of Symbolic Logic / Volume 33 / Issue 1 / 26 April 1968
- Published online by Cambridge University Press:
- 12 March 2014, pp. 118-119
- Print publication:
- 26 April 1968
-
- Article
- Export citation
F. C. Hennie. One-tape, off-line Turing machine computations. Information and control, vol. 8 (1965), pp. 553–578.
-
- Journal:
- The Journal of Symbolic Logic / Volume 33 / Issue 1 / 26 April 1968
- Published online by Cambridge University Press:
- 12 March 2014, pp. 119-120
- Print publication:
- 26 April 1968
-
- Article
- Export citation
J. Hartmanis and R. E. Stearns. Computational complexity of recursive sequences. Switching circuit theory and logical design, Proceedings of the Fifth Annual Symposium, Princeton University, Princeton, N.J., November 11–13, 1964, The Institute of Electrical and Electronics Engineers, Inc., New York1964, pp. 82–90.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 1 / June 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 121-122
- Print publication:
- June 1967
-
- Article
- Export citation
J. Hartmanis and R. E. Stearns. On the computational complexity of algorithms. Transactions of the American Mathematical Society, vol. 117 (1965), pp. 285–306.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 1 / June 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 120-121
- Print publication:
- June 1967
-
- Article
- Export citation
Michael O. Rabin. Real time computation. Israel journal of mathematics, vol. 1 (1963), pp. 203–211.
-
- Journal:
- The Journal of Symbolic Logic / Volume 31 / Issue 4 / December 1966
- Published online by Cambridge University Press:
- 12 March 2014, p. 657
- Print publication:
- December 1966
-
- Article
- Export citation
Hisao Yamada. Real-time computation and recursive functions not real-time computable. IRE transactions on electronic computers, vol. EC-11 (1962), pp. 753–760.
-
- Journal:
- The Journal of Symbolic Logic / Volume 31 / Issue 4 / December 1966
- Published online by Cambridge University Press:
- 12 March 2014, pp. 656-657
- Print publication:
- December 1966
-
- Article
- Export citation
M. A. Ajzérman, L. A. Gusév, L. I. Rozonoer, I. M. Smirnova, and A. A. Tal′. Logika, avtomaty, algoritmy (Logic, automata, algorithms). Gosudarstvénnoé Izdatel′stvo Fiziko-matématičéskoj Literatury, Moscow1963, 556 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 31 / Issue 1 / March 1966
- Published online by Cambridge University Press:
- 12 March 2014, pp. 109-111
- Print publication:
- March 1966
-
- Article
- Export citation
V. M. Gluškov. Sintéz cifrovyh avtomatov (Synthesis of digital automata). Gosudarstvénnoé Izdatél'stvo Fiziko-matématičéskoj Litératury, Moscow1962, 476 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 30 / Issue 3 / September 1965
- Published online by Cambridge University Press:
- 12 March 2014, pp. 380-381
- Print publication:
- September 1965
-
- Article
- Export citation
B. A. Trahténbrot. Konéčnyé avtomaty i logika odnoméstnyh predikátov (Finite automata and the logic of singulary predicates). Doklady Akadémii Nauk SSSR, vol. 138 (1961), pp. 326–329.
-
- Journal:
- The Journal of Symbolic Logic / Volume 29 / Issue 2 / June 1964
- Published online by Cambridge University Press:
- 12 March 2014, p. 100
- Print publication:
- June 1964
-
- Article
- Export citation
B. A. Trahténbrot. Konéčnyé avtomaty i logika odnoméstnyh predikátov (Finite automata and the logic of singulary predicates). Sibirskij tnatématičéskij žurnal, vol. 3 (1962), pp. 103–131.
-
- Journal:
- The Journal of Symbolic Logic / Volume 29 / Issue 2 / June 1964
- Published online by Cambridge University Press:
- 12 March 2014, pp. 98-100
- Print publication:
- June 1964
-
- Article
- Export citation
N. É. Kobrinskij and B. A. Trahténbrot. Vvédénié v téoriú konéčnyh avtomatov (Introduction to the theory of finite automata). Gosudarstvénnoé Izdatél'stvo Fiziko-matématičéskoj Litératury, Moscow1962, 404 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 29 / Issue 2 / June 1964
- Published online by Cambridge University Press:
- 12 March 2014, pp. 97-98
- Print publication:
- June 1964
-
- Article
- Export citation