11 found
Order:
  1.  21
    Rado Tibor. On a Simple Source for Non-Computable Functions. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962, Microwave Research Institute Symposia Series Vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, Pp. 75–81. [REVIEW]F. B. Cannonito - 1968 - Journal of Symbolic Logic 32 (4):524-524.
  2.  12
    Mayoh B. H.. Groups and Semigroups with Solvable Word Problems. Proceedings of the American Mathematical Society, Vol. 18 , Pp. 1038–1039. [REVIEW]F. B. Cannonito - 1971 - Journal of Symbolic Logic 36 (3):541-541.
  3.  12
    Review: Clement F. Kent, Constructive Analogues of the Group of Permutations of the Natural Numbers. [REVIEW]F. B. Cannonito - 1969 - Journal of Symbolic Logic 34 (3):517-518.
  4.  8
    Rado T.. On Non-Computable Functions. The Bell System Technical Journal, Vol. 41 , Pp. 877–884.F. B. Cannonito - 1968 - Journal of Symbolic Logic 32 (4):524-524.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5.  8
    Review: B. H. Mayoh, Groups and Semigroups with Solvable Word Problems. [REVIEW]F. B. Cannonito - 1971 - Journal of Symbolic Logic 36 (3):541-541.
  6.  6
    Kent Clement F.. Constructive Analogues of the Group of Permutations of the Natural Numbers. Transactions of the American Mathematical Society, Vol. 104 , Pp. 347–362. [REVIEW]F. B. Cannonito - 1969 - Journal of Symbolic Logic 34 (3):517-518.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7.  4
    Włodzimierz Mostowski A.. On the Decidability of Some Problems in Special Classes of Groups. Fundamenta Mathematicae, Vol. 59 , Pp. 123–135.Włodzimierz Mostowski A.. Computational Algorithms for Deciding Some Problems for Nilpotent Groups. Fundamenta Mathematicae, Vol. 59 , Pp. 137–152. [REVIEW]F. B. Cannonito - 1970 - Journal of Symbolic Logic 35 (3):476-477.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  8. Review: T. Rado, On Non-Computable Functions. [REVIEW]F. B. Cannonito - 1967 - Journal of Symbolic Logic 32 (4):524-524.
  9.  3
    Review: A. Wlodzimierz Mostowski, On the Decidability of Some Problems in Special Classes of Groups; A. Wlodzimierz Mostowski, Computational Algorithms for Deciding Some Problems for Nilpotent Groups. [REVIEW]F. B. Cannonito - 1970 - Journal of Symbolic Logic 35 (3):476-477.
  10. Review: Tibor Rado, On a Simple Source for Non-Computable Functions. [REVIEW]F. B. Cannonito - 1967 - Journal of Symbolic Logic 32 (4):524-524.
  11. Review: S. Tennenbaum, Degree of Unsolvability and the Rate of Growth of Functions. [REVIEW]F. B. Cannonito - 1967 - Journal of Symbolic Logic 32 (4):524-524.