Results for 'Association for Computing Machinery'

999 found
Order:
  1. Theoretical Aspects of Reasoning About Knowledge Proceedings of the 1986 Conference, March 19-22, 1986, Monterey, California. [REVIEW]Joseph Y. Halpern, International Business Machines Corporation, American Association of Artificial Intelligence, United States & Association for Computing Machinery - 1986
     
    Export citation  
     
    Bookmark  
  2. Science, Philosophy, and Our Educational Tasks Papers for a Symposium Held at the Annual Meeting of the American Philosophical Association, Western Division, Milwaukee, Wisconsin, April 29, 1964.George Kimball Plochmann, John Peter Anton & American Philosophical Association - 1966 - University Council for Educational Administration.
     
    Export citation  
     
    Bookmark  
  3.  24
    C.Y. Lee. Categorizing Automata by W-Machine Programs. Journal of the Association for Computing Machinery, Bd. 8 , S. 384–399. - Seiiti Huzino Und Mariko Yoneyama. On a Proof of Schepherdson's Theorem. Memoirs of the Faculty of Science, Kyushu University, Series A Mathematics, Bd. 16 , S. 88–93. [REVIEW]Gunter Asser - 1968 - Journal of Symbolic Logic 33 (4):628.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  4.  23
    David G. Cantor. On the Ambiguity Problem of Backus Systems. Journal of the Association for Computing Machinery, Vol. 9 , Pp. 477–479. [REVIEW]S. -Y. Kuroda - 1967 - Journal of Symbolic Logic 32 (1):114.
  5.  23
    Michael A. Harrison. The Number of Transitivity Sets of Boolean Functions. Journal of the Society for Industrial and Applied Mathematics, T. 11 , P. 806–828. - Michael A. Harrison. The Number of Equivalence Classes of Boolean Functions Under Groups Containing Negation. IEEE Transactions on Electronic Computers, T. EC-12 , P. 559–561. - Michael A. Harrison. On the Number of Classes of Switching Networks. Journal of the Franklin Institute, T. 276 , P. 313–327. - Michael A. Harrison. The Number of Classes of Invertible Boolean Functions. Journal of the Association for Computing Machinery, T. 10 , P. 25–28. [REVIEW]J. Kuntzmann - 1970 - Journal of Symbolic Logic 35 (1):160-161.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  6.  21
    J. W. Backus, F. L. Bauer, J. Green, C. Katz, J. McCarthy, P. Naur , A. J. Perlis, H. Rutishauser, K. Samelson, B. Vauquois, J. H. Wegstein, A. Van Wijngaarden, and M. Woodger. Report on the Algorithmic Language ALGOL 60. Numerische Mathematik, Vol. 2 , Pp. 106–136; Also Communications of the Association for Computing Machinery, Vol. 3 , Pp. 299–314. [REVIEW]Karel Čulík - 1972 - Journal of Symbolic Logic 37 (3):622-623.
  7.  20
    Joyce Friedman. A Semi-Decision Procedure for the Functional Calculus. Journal of the Association for Computing Machinery, Vol. 10 , Pp. 1–24. - Joyce Friedman. A Computer Program for a Solvable Case of the Decision Problem. Journal of the Association for Computing Machinery, Vol. 10 , Pp. 348–356. [REVIEW]Frederic B. Fitch - 1964 - Journal of Symbolic Logic 29 (2):101.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  8.  20
    Martin Davis and Hilary Putnam. A Computing Procedure for Quantification Theory. Journal of the Association for Computing Machinery, Vol. 7 , Pp. 201–215. [REVIEW]J. A. Robinson - 1966 - Journal of Symbolic Logic 31 (1):125-126.
  9.  19
    Michael Arbib. Turing Machines, Finite Automata and Neural Nets. Journal of the Association for Computing Machinery, Vol. 8 , Pp. 467–475. [REVIEW]Joseph S. Ullian - 1970 - Journal of Symbolic Logic 35 (3):482.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  10.  18
    Seymour Ginsburg and Edwin H. Spanier. Quotients of Context-Free Languages. Journal of the Association for Computing Machinery, Vol. 10 , Pp. 487–492. [REVIEW]Asa Kasher - 1969 - Journal of Symbolic Logic 34 (1):135-136.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  11.  17
    Seymour Ginsburg and Joseph Ullian. Ambiguity in Context Free Languages. Journal of the Association for Computing Machinery, Vol. 13 , Pp. 62–89. - Seymour Ginsburg and Joseph Ullian. Preservation of Unambiguity and Inherent Ambiguity in Context-Free Languages.Journal of the Association for Computing Machinery, Vol. 13 , Pp. 364–368. - Thomas N. Hibbard and Joseph Ullian, The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages. Journal of the Association for Computing Machinery, Vol. 13 , Pp. 588–593. [REVIEW]D. Terence Langendoen - 1968 - Journal of Symbolic Logic 33 (2):301-302.
  12.  16
    Wang Hao. Tag Systems and Lag Systems. Mathematische Annalen, Vol. 152 , Pp. 65–74.Cocke John and Minsky Marvin. Universality of Tag Systems with D = 2. Journal of the Association for Computing Machinery, Vol. 11 , Pp. 15–20.Cook Stephen A.. The Solvability of the Derivability Problem for One-Normal Systems. Journal of the Association for Computing Machinery, Vol. 13 , Pp. 223–225. [REVIEW]Ann Yasuhara - 1971 - Journal of Symbolic Logic 36 (2):344.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  13.  15
    J. C. Shepherdson Und H. E. Sturgis. Computability of Recursive Functions. Journal of the Association for Computing Machinery, Bd. 10 , S. 217–255. [REVIEW]Günter Asser - 1967 - Journal of Symbolic Logic 32 (1):122-123.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  14.  14
    Philip K. Hooper. Monogenic Post Normal Systems of Arbitrary Degree. Journal of the Association for Computing Machinery, Vol. 13 , Pp. 359–363. [REVIEW]M. D. Gladstone - 1969 - Journal of Symbolic Logic 34 (3):508-509.
  15.  14
    Seymour Ginsburg and H. Gordon Rice. Two Families of Languages Related to ALGOL. Journal of the Association for Computing Machinery, Vol. 9 , Pp. 350–371. [REVIEW]Asa Kasher - 1969 - Journal of Symbolic Logic 34 (1):135.
  16.  14
    Patrick C. Fischer. On Formalisms for Turing Machines. Journal of the Association for Computing Machinery, Vol. 12 , Pp. 570–580. - Stål Aanderaa and Patrick C. Fischer. The Solvability of the Halting Problem for 2-State Post Machines. Journal of the Association for Computing Machinery, Vol. 14 , Pp. 677–682. - Patrick C. Fischer. Quantificational Variants on the Halting Problem for Turing Machines. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 15 , Pp. 211–218. [REVIEW]Gabor T. Herman - 1971 - Journal of Symbolic Logic 36 (3):532-534.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  17.  14
    James R. Slagle. Automatic Theorem Proving with Renamable and Semantic Resolution. Journal of the Association for Computing Machinery, Vol. 14 , Pp. 687–697. [REVIEW]Lawrence T. Wos - 1970 - Journal of Symbolic Logic 35 (4):595-596.
  18.  13
    Dag Prawitz, Håkon Prawitz, and Neri Voghera. A Mechanical Proof Procedure and its Realization in an Electronic Computer.Journal of the Association for Computing Machinery, Vol. 7 , Pp. 102–128. [REVIEW]J. A. Robinson - 1966 - Journal of Symbolic Logic 31 (1):126-126.
  19.  13
    Janusz A. Brzozowski. Derivatives of Regular Expressions. Journal of the Association for Computing Machinery, Vol. 11 , Pp. 481–494. [REVIEW]S. Huzino - 1971 - Journal of Symbolic Logic 36 (1):152.
  20.  13
    H. Allen Curtis. A Functional Canonical Form. Journal of the Association for Computing Machinery, Vol. 6 , Pp. 245–258. - H. Allen Curtis. Multifunctional Circuits in Functional Canonical Form. Journal of the Association for Computing Machinery, Vol. 6 , Pp. 538–547. - H. Allen Curtis. A New Approach to the Design of Switching Circuits. D. Van Nostrand Company, Inc., Princeton-Toronto-London-New York, 1962, Viii + 635 Pp. - R. L. Ashenhurst. The Decomposition of Switching Functions. Therein, Pp. 571–602. - Theodore Singer. The Decomposition Chart as a Theoretical Aid. Therein, Pp. 602–620. [REVIEW]Harold S. Stone - 1972 - Journal of Symbolic Logic 37 (4):760-762.
  21.  13
    Dennis F. Cudia and Wilson E. Singletary. The Post Correspondence Problem. The Journal of Symbolic Logic, Vol. 33 , Pp. 418–430. - Dennis F. Cudia and Wilson E. Singletary. Degrees of Unsolvability in Formal Grammars. Journal of the Association for Computing Machinery, Vol. 15 , Pp. 680–692. [REVIEW]Ann Yasuhara - 1974 - Journal of Symbolic Logic 39 (1):185-186.
  22.  11
    Eugene L. Lawler. An Approach to Multilevel Boolean Minimization. Journal of the Association for Computing Machinery, Vol. 11 , Pp. 283–295. [REVIEW]A. K. Choudhury - 1969 - Journal of Symbolic Logic 33 (4):630-631.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  23.  11
    Michael O. Rabin and Hao Wang. Words in the History of a Turing Machine with a Fixed Input. Journal of the Association for Computing Machinery, Vol. 10 , Pp. 526–527. [REVIEW]Joyce Friedman - 1969 - Journal of Symbolic Logic 34 (3):508.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  24.  10
    Ronald Prather. Computational Aids for Determining the Minimal Form of a Truth Function. Journal of the Association for Computing Machinery, Vol. 7 , Pp. 299–310. [REVIEW]Ann S. Ferebee - 1968 - Journal of Symbolic Logic 33 (4):630.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  25.  10
    Sheila Greibach. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars. Journal of the Association for Computing Machinery, Vol. 12 , Pp. 42–52. [REVIEW]Rohit Parikh - 1969 - Journal of Symbolic Logic 34 (4):658.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  26.  10
    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]Jiří Bečvář - 1973 - Journal of Symbolic Logic 38 (2):343.
  27.  9
    Peter B. Andrews. Resolution with Merging. Journal of the Association for Computing Machinery, Vol. 15 , Pp. 367–381.David Luckham - 1970 - Journal of Symbolic Logic 35 (1):159-160.
  28.  9
    Robert A. Dipaola. Random Sets in Subrecursive Hierarchies. Journal of the Association for Computing Machinery, Vol. 16 , Pp. 621–630. [REVIEW]Donald W. Loveland - 1975 - Journal of Symbolic Logic 40 (2):249-250.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  29.  8
    Manuel Blum. A Machine-Independent Theory of the Complexity of Recursive Functions. Journal of the Association for Computing Machinery, Vol. 14 , Pp. 322–336. [REVIEW]Stephen A. Cook - 1969 - Journal of Symbolic Logic 34 (4):657-658.
  30.  7
    Oliver Aberth. Analysis in the Computable Number Field. Journal of the Association for Computing Machinery, Vol. 15 , Pp. 275–299. [REVIEW]Brian H. Mayoh - 1975 - Journal of Symbolic Logic 40 (1):84.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  31.  7
    Donald M. Kaplan. Some Completeness Results in the Mathematical Theory of Computation. Journal of the Association for Computing Machinery, Vol. 15 , Pp. 124–134. [REVIEW]Richard J. Orgass - 1975 - Journal of Symbolic Logic 40 (2):246-247.
  32.  4
    Joyce Friedman. A Decision Procedure for Computations of Finite Automata. Journal of the Association for Computing Machinery, Vol. 9 , Pp. 315–323. [REVIEW]Robert McNaughton - 1965 - Journal of Symbolic Logic 30 (2):248-249.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  33.  4
    Lawrence Wos, George A. Robinson, and Daniel F. Carson. Efficiency and Completeness of the Set of Support Strategy in Theorem Proving. Journal of the Association for Computing Machinery, Vol. 12 , Pp. 536–541. [REVIEW]David Luckham - 1967 - Journal of Symbolic Logic 32 (1):117-118.
  34.  22
    Burkhart W. H.. A Method for Synthesis of Two-Valued Feedback Circuits. Proceedings of the Association for Computing Machinery, Jointly Sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, Photo-Offset, Richard Rimbach Associates, Pittsburgh 1952, Pp. 265–272. [REVIEW]Raymond J. Nelson - 1954 - Journal of Symbolic Logic 19 (1):56-56.
  35.  21
    Greibach Sheila A.. The unsolvability of the recognition of linear context-free languages. Journal of the Association for Computing Machinery, vol. 13 , pp. 582–587. [REVIEW]Seymour Ginsburg - 1971 - Journal of Symbolic Logic 36 (4):693-693.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  36.  19
    Lin Shen and Rado Tibor. Computer Studies of Turing Machine Problems. Journal of the Association for Computing Machinery, Vol. 12 , Pp. 196–212.Brady Allen H.. The Conjectured Highest Scoring Machines for Rado's Σ for the Value K = 4. IEEE Transactions on Electronic Computers, Vol. EC-15 , Pp. 802–803.Green Milton W.. A Lower Bound on Rado's Sigma Function for Binary Turing Machines. 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 York 1964, Pp. 91–94. [REVIEW]H. B. Enderton - 1975 - Journal of Symbolic Logic 40 (4):617-617.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  37.  17
    Hirschhorn Edwin. Simplification of a Class of Boolean Functions. Journal of the Association for Computing Machinery, Vol. 5 No. 1 , Pp. 67–75. [REVIEW]E. J. McCluskey - 1958 - Journal of Symbolic Logic 23 (2):236-237.
  38.  15
    Semon Warren L.. Characteristic Numbers and Their Use in the Decomposition of Switching Functions. Proceedings of the Association for Computing Machinery, Jointly Sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, Photo-Offset, Richard Rimbach Associates, Pittsburgh 1952, Pp. 273–280. [REVIEW]Raymond J. Nelson - 1954 - Journal of Symbolic Logic 19 (1):57-57.
  39.  12
    House R. W. And Rado T.. On a Computer Program for Obtaining Irreducible Representations for Two-Level Multiple Input-Output Logical Systems. Journal of the Association for Computing Machinery, Vol. 10 , Pp. 48–77. [REVIEW]Thomas H. Mott - 1967 - Journal of Symbolic Logic 32 (2):264-265.
  40.  11
    Kalin Theodore A.. Formal Logic and Switching Circuits. Proceedings of the Association for Computing Machinery, Jointly Sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, Photo-Offset, Richard Rimbach Associates, Pittsburgh 1952, Pp. 251–257. [REVIEW]Alonzo Church - 1953 - Journal of Symbolic Logic 18 (4):345-346.
  41.  11
    Wang Hao. Proving Theorems by Pattern Recognition I. Communications of the Association for Computing Machinery, Vol. 3 , Pp. 220–234.Wang Hao. Proving Theorems by Pattern Recognition—II. The Bell System Technical Journal, Vol. 40 , Pp. 1–41. [REVIEW]David C. Cooper - 1967 - Journal of Symbolic Logic 32 (1):119-120.
  42.  9
    McCarthy John. Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I. Communications of the Association for Computing Machinery, Vol. 3 , Pp. 184–195. [REVIEW]Martin Davis - 1968 - Journal of Symbolic Logic 33 (1):117-117.
  43.  9
    Markov A. A.. Ob Invérsionnoj Složnosti Sistém Funkcij. Doklady Akadémii Nauk SSSR, Vol. 116 , Pp. 917–919.Markov A. A.. On the Inversion Complexity of a System of Functions. English Translation of the Preceding by Morris D. Friedman. Journal of the Association for Computing Machinery, Vol. 5 , Pp. 331–334. [REVIEW]E. N. Gilbert - 1965 - Journal of Symbolic Logic 30 (3):378-379.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  44.  9
    Burkhart W. H.. Theorem Minimization. Proceedings of the Association for Computing Machinery, Jointly Sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, Photo-Offset, Richard Rimbach Associates, Pittsburgh 1952, Pp. 259–263. [REVIEW]Raymond J. Nelson - 1953 - Journal of Symbolic Logic 18 (4):348-348.
  45.  8
    Yasuhara Ann. A Remark on Post Normal Systems. Journal of the Association for Computing Machinery, Vol. 14 , Pp. 167–171. [REVIEW]M. D. Gladstone - 1968 - Journal of Symbolic Logic 33 (1):116-117.
  46.  8
    Jeffrey Richard C.. Arithmetical Analysis of Digital Computing Nets. Journal of the Association for Computing Machinery, Vol. 3 , Pp. 360–375. [REVIEW]E. J. McCluskey - 1960 - Journal of Symbolic Logic 25 (2):190-191.
  47.  8
    Elgot Calvin C.. On Single Vs. Triple Address Computing Machines. Journal of the Association for Computing Machinery, Vol. 1 No. 3 , Pp. 119–123. [REVIEW]Raymond J. Nelson - 1956 - Journal of Symbolic Logic 21 (2):208-209.
  48.  8
    Murray F. J.. Mechanisms, and Robots. Journal of the Association for Computing Machinery, Vol. 2 , Pp. 61–82.Raymond J. Nelson - 1956 - Journal of Symbolic Logic 21 (3):334-335.
  49.  10
    E. W. Veitch. A Chart Method for Simplifying Truth Functions. Proceedings of the Association for Computing Machinery, Jointly Sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, Photo-Offset, Richard Rimbach Associates, Pittsburgh1952, Pp. 127–133. [REVIEW]Raymond J. Nelson - 1954 - Journal of Symbolic Logic 19 (1):56-56.
  50.  6
    Patterson G. W.. What is a Code? Communications of the Association for Computing Machinery, Vol. 3 No. 5 , Pp. 315–318.Richard C. Jeffrey - 1965 - Journal of Symbolic Logic 30 (3):385-385.
1 — 50 / 999