- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by Jiří Bečvář
16 found
Order:
- F. C. Hennie. One-tape, off-line Turing machine computations. Information and control, vol. 8 , pp. 553–578.Jiří Bečvář - 1968 - Journal of Symbolic Logic 33 (1):119-120.
- Real Time Computation.Jiří Bečvář - 1966 - Journal of Symbolic Logic 31 (4):657.
- Review: B. A. Trahtenbrot, Doklady akademii nauk SSSR. [REVIEW]Jiří Bečvář - 1964 - Journal of Symbolic Logic 29 (2):98-100.
- G. S. Matvééva. К téorémé Rabina o složnosti vyčislimyh funkcij . Sibirskij matématičéskij žurnal, vol. 6 , pp. 546–555. [REVIEW]Jiří Bečvář - 1969 - Journal of Symbolic Logic 34 (1):133-134.
- (1 other version)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. [REVIEW]Jiří Bečvář - 1967 - Journal of Symbolic Logic 32 (1):121-122.
- Hisao Yamada. Real-time computation and recursive functions not real-time computable. IRE transactions on electronic computers, vol. EC-11 , pp. 753–760. [REVIEW]Jiří Bečvář - 1966 - Journal of Symbolic Logic 31 (4):656-657.
- John E. Hopcroft and Jeffrey D. Ullman. Relations between time and tape complexities. Journal of the Association for Computing Machinery, vol. 15 , pp. 414–427. [REVIEW]Jiri Becvar - 1973 - Journal of Symbolic Logic 38 (2):343.
- J. Hartmanis and R. E. Stearns. On the computational complexity of algorithms. Transactions of the American Mathematical Society, vol. 117 , pp. 285–306. [REVIEW]Jiří Bečvář - 1967 - Journal of Symbolic Logic 32 (1):120-121.
- M. A. Ajzérman, L. A. Gusév, L. I. Rozonoer, I. M. Smirnova, and A. A. Tal′. Logika, avtomaty, algoritmy . Gosudarstvénnoé Izdatel′stvo Fiziko-matématičéskoj Literatury, Moscow1963, 556 pp. [REVIEW]Jiří Bečvář - 1966 - Journal of Symbolic Logic 31 (1):109-111.
- (1 other version)N. É. Kobrinskij and B. A. Trahténbrot. Vvédénié v téoriú konéčnyh avtomatov . Gosudarstvénnoé Izdatél'stvo Fiziko-matématičéskoj Litératury, Moscow1962, 404 pp. [REVIEW]Jiří Bečvář - 1964 - Journal of Symbolic Logic 29 (2):97-98.
- 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. [REVIEW]Jiří Bečvář - 1971 - Journal of Symbolic Logic 36 (2):344-346.
- Trahténbrot B. A.. T′úringovy vyčisléniá s logarifmičéskim zamédléniém . Algébra i logika, Séminar, vol. 3 no. 4 , pp. 33–48. [REVIEW]Jiří Bečvář - 1968 - Journal of Symbolic Logic 33 (1):118-119.
- Trahténbrot B. A.. Optimal′nyé vyčísléniá i častotnoé ávlénié Åblonskogo . Algébra i logika, Séminar, vol. 4 no. 5 , pp. 79–93. [REVIEW]Jiří Bečvář - 1969 - Journal of Symbolic Logic 34 (1):134-134.
- Trahténbrot B. A.. Složnost algoritmov i vyčíslenij ). Novosibirskij Gosudarstvénnyj Univérsitét, Novosibirsk 1967, 258 pp., mimeographed. [REVIEW]Jiří Bečvář - 1970 - Journal of Symbolic Logic 35 (2):337-339.
- Trahténbrot B. A.. Konéčnyé avtomaty i logika odnoméstnyh predikátov . Doklady Akadémii Nauk SSSR, vol. 138 , pp. 326–329. [REVIEW]Jiří Bečvář - 1964 - Journal of Symbolic Logic 29 (2):100-100.
- V. M. Gluškov. Sintéz cifrovyh avtomatov . Gosudarstvénnoé Izdatél'stvo Fiziko-matématičéskoj Litératury, Moscow1962, 476 pp. [REVIEW]Jiří Bečvář - 1965 - Journal of Symbolic Logic 30 (3):380-381.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-99fc7d78b-dwqgq uwo