Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Sortiert nach
Einfacher Volltextzugriff von (fast) überall
Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...
    Datensatz exportieren als...
  • BibTeX
Logic, Automata, and Computational Complexity: The Works Of Stephen A. Cook . Edited by Bruce M. Kapron, ACM Books, vol. 43. Association for Computing Machinery, New York, xxvi + 398 pp.—therein: - Michelle Waitzman. Stephen Cook: Complexity’s Humble Hero , pp. 3–28. - Bruce M. Kapron and Stephen A. Cook, ACM Interview of Stephen A. Cook by Bruce M. Kapron , pp. 29–44. - Stephen A. Cook, Overview of Computational Complexity , pp. 47–70. - Christos H. Papadimitriou, Cook’s NP-Completeness Paper a
The bulletin of symbolic logic, 2023-12, Vol.29 (4), p.657-660
2023
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Theodore Singer. The theory of counting techniques. 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. 287–291. - Robert L. Ashenhurst. The application of counting techniques. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon In
The Journal of symbolic logic, 1954-03, Vol.19 (1), p.56-57
1954
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
W. H. Burkhart. 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, Pittsburgh1952, pp. 259–263
The Journal of symbolic logic, 1953-12, Vol.18 (4), p.348-348
1953
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
W. H. Burkhart. 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, Pittsburgh1952, pp. 265–272
The Journal of symbolic logic, 1954-03, Vol.19 (1), p.56-56
1954
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Warren L. Semon. 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, Pittsburgh1952, pp. 273–280
The Journal of symbolic logic, 1954-03, Vol.19 (1), p.57-57
1954
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
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
The Journal of symbolic logic, 1954-03, Vol.19 (1), p.56-56
1954
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Theodore A. Kalin. 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, Pittsburgh1952, pp. 251–257
The Journal of symbolic logic, 1953-12, Vol.18 (4), p.345-346
1953
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
E. F. Moore. A simplified universal Turing machine. Proceedings of the Association for Computing Machinery, meeting at Toronto, Ont., Jointly sponsored by the Association for Computing Machinery and the University of Toronto, September 8 to 10, 1952, photo-offset, Sauls Lithograph Company, Washington, D.C., 1952, pp. 50–55
The Journal of symbolic logic, 1954-03, Vol.19 (1), p.57-58
1954
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
H. Allen Curtis. A functional canonical form. Journal of the Association for Computing Machinery, vol. 6 (1959), pp. 245–258. - H. Allen Curtis. Multifunctional circuits in functional canonical form. Journal of the Association for Computing Machinery, vol. 6 (1959), 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.
The Journal of symbolic logic, 1972-12, Vol.37 (4), p.760-762
1972
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Hao Wang. Tag systems and lag systems. Mathematische Annalen, vol. 152 (1963), pp. 65–74. - John Cocke and Marvin Minsky. Universality of tag systems with D = 2. Journal of the Association for Computing Machinery, vol. 11 (1964), pp. 15–20. - Stephen A. Cook. The solvability of the derivability problem for one-normal systems. Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 223–225
The Journal of symbolic logic, 1971-06, Vol.36 (2), p.344-344
1971
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Patrick C. Fischer. On formalisms for Turing machines. Journal of the Association for Computing Machinery, vol. 12 (1965), 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 (1967), 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 (1969), pp
The Journal of symbolic logic, 1971-09, Vol.36 (3), p.532-534
1971
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Joyce Friedman. A semi-decision procedure for the functional calculus. Journal of the Association for Computing Machinery, vol. 10 (1963), 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 (1963), pp. 348–356
The Journal of symbolic logic, 1964-06, Vol.29 (2), p.101-101
1964
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Seymour Ginsburg and Joseph Ullian. Ambiguity in context free languages. Journal of the Association for Computing Machinery, vol. 13 (1966), 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 (1966), pp. 364–368. - Thomas N. Hibbard and Joseph Ullian, The independence of inherent ambiguity from complementedness among context-free languages. Journal of the Associa
The Journal of symbolic logic, 1968-07, Vol.33 (2), p.301-302
1968
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Logic, Automata, and Computational Complexity: The Works Of Stephen A. Cook. Edited by KapronBruce M., ACM Books, vol. 43. Association for Computing Machinery, New York, xxvi + 398 pp.—therein
The Bulletin of Symbolic Logic, 2023, Vol.29 (4), p.657-660
2023
Volltextzugriff (PDF)
Open Access
    Datensatz exportieren als...
  • BibTeX
Reviewer bias in single- versus double-blind peer review
Proceedings of the National Academy of Sciences - PNAS, 2017-11, Vol.114 (48), p.12708-12713
2017
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Logic, Automata, and Computational Complexity: The Works Of Stephen A. Cook. Edited by Kapron, Bruce M., ACM Books, vol. 43. Association for Computing Machinery, New York, xxvi + 398 pp.—therein: Waitzman, Michelle .; Stephen Cook: Complexity’s Humble Hero, pp. 3 – 28 . Kapron, Bruce M. and Cook, Stephen A. ,; ACM Interview of Stephen A. Cook by Bruce M. Kapron, pp. 29 – 44 . Cook, Stephen A. ,; Overview of Computational Complexity, pp. 47 – 70 . Papadimitriou, Christos H. ,; Cook’s NP-Completen
The Bulletin of Symbolic Logic, 2023, Vol.29 (4), p.657-660
2023
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Richard C. Jeffrey. Arithmetical analysis of digital computing nets. Journal of the Association for Computing Machinery, vol. 3 (1956), pp. 360–375
The Journal of symbolic logic, 1960-06, Vol.25 (2), p.190-191
1960
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Calvin C. Elgot. On single vs. triple address computing machines. Journal of the Association for Computing Machinery, vol. 1 no. 3 (1954), pp. 119–123
The Journal of symbolic logic, 1956-06, Vol.21 (2), p.208-209
1956
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, vol. 7 (1960), pp. 201–215
The Journal of symbolic logic, 1966-03, Vol.31 (1), p.125-126
1966
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Artificial Vision: Visual Prosthesis . The Interdisciplinary Dialogue. Proceedings of a conference, Chicago, June 1969. T. D. Sterling, E. A. Bering, Jr., S. V. Pollack, and H. G. Vaughan, Jr., Eds. Academic Press, New York, 1971. xviii, 382 pp., illus. $18.50. Association for Computing Machinery Monograph Series
Science (American Association for the Advancement of Science), 1971-09, Vol.173 (4001), p.1014-1015
1971
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Janusz A. Brzozowski. Derivatives of regular expressions. Journal of the Association for Computing Machinery, vol. 11 (1964), pp. 481–494
The Journal of symbolic logic, 1971-03, Vol.36 (1), p.152-152
1971
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Robert A. Dipaola. Random sets in subrecursive hierarchies. Journal of the Association for Computing Machinery, vol. 16 (1969), pp. 621–630
The Journal of symbolic logic, 1975-06, Vol.40 (2), p.249-250
1975
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Donald M. Kaplan. Some completeness results in the mathematical theory of computation. Journal of the Association for Computing Machinery, vol. 15 (1968), pp. 124–134
The Journal of symbolic logic, 1975-06, Vol.40 (2), p.246-247
1975
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Oliver Aberth. Analysis in the computable number field. Journal of the Association for Computing Machinery, vol. 15 (1968), pp. 275–299
The Journal of symbolic logic, 1975-03, Vol.40 (1), p.84-84
1975
Volltextzugriff (PDF)
    Datensatz exportieren als...
  • BibTeX
Hao Wang. A variant to Turing's theory of computing machines. Journal of the Association for Computing Machinery, vol. 4 (1957), pp. 63–92. Reprinted as A variant to Turing's theory of calculating machines , in A survey of mathematical logic , by Hao Wang, Studies in logic and the foundations of mathematics, Science Press, Peking, and North-Holland Publishing Company, Amsterdam, 1963, pp. 127–159. - Hao Wang. Universal Turing machines: an exercise in coding. Zeitschrift für mathematische Logik u
The Journal of symbolic logic, 1963-12, Vol.28 (4), p.288-289
1963
Volltextzugriff (PDF)
1 – 25 von 4.159
Suche als RSS-Feed
Aktive Filter
PublikationsformTexte
KollektionJSTOR
Suchergebnisse filtern
Filter anzeigen
Nur zeigen
Publikationsform
Sprache
3 weitere anzeigen...
Weniger anzeigen...
Erscheinungsjahr
n.n
n.n
Thema
15 weitere anzeigen...
Weniger anzeigen...
Kollektion
14 weitere anzeigen...
Weniger anzeigen...
Zeitschrift / Serie
5 weitere anzeigen...
Weniger anzeigen...
Neu hinzugefügt