J. Hartmanis. Context-free languages and Turing machine computations. Mathematical aspects of computer science, Proceedings of symposia in applied mathematics, vol. 19, American Mathematical Society, Providence1967, pp. 42–51.

S. Ginsburg

doi:10.2307/2272443

J. Hartmanis. Context-free languages and Turing machine computations. Mathematical aspects of computer science, Proceedings of symposia in applied mathematics, vol. 19, American Mathematical Society, Providence1967, pp. 42–51.

Journal of Symbolic Logic ◽

10.2307/2272443 ◽

1972 ◽

Vol 37 (4) ◽

pp. 759-759

Author(s):

S. Ginsburg

Keyword(s):

Computer Science ◽

Turing Machine ◽

Applied Mathematics ◽

American Mathematical Society ◽

Mathematical Society ◽

Context Free

Download Full-text

J. A. Robinson. A review of automatic theorem-proving. Mathematical aspects of computer science, Proceedings of symposia in applied mathematics, vol. 19, American Mathematical Society, Providence1967, pp. 1–18.

Journal of Symbolic Logic ◽

10.2307/2272385 ◽

1974 ◽

Vol 39 (1) ◽

pp. 190-190

Author(s):

L. Wos

Keyword(s):

Computer Science ◽

Theorem Proving ◽

Applied Mathematics ◽

American Mathematical Society ◽

Mathematical Society ◽

Automatic Theorem Proving ◽

Automatic Theorem

Download Full-text

Bioconsensus.—M. F. Janowitz, F.-J. Lapointe, F. R. McMorris, B. Mirkin, and F. S. Roberts, editors. (DIMACS series in discrete mathematics and theoretical computer science, v. 61). 2003. American Mathematical Society. 242 pp. ISBN 0–8218–3197–6. $75.00.

Systematic Biology ◽

10.1080/10635150490445887 ◽

2004 ◽

Vol 53 (3) ◽

pp. 515-517

Author(s):

Tanya Y. Berger-Wolf

Keyword(s):

Computer Science ◽

American Mathematical Society ◽

Theoretical Computer Science ◽

Mathematical Society ◽

Discrete Mathematics ◽

Theoretical Computer

Download Full-text

Applied Probability. Vol. VII. Proceedings of the Seventh Symposium in Applied Mathematics of American Mathematical Society

The Mathematical Gazette ◽

10.2307/3610991 ◽

1959 ◽

Vol 43 (345) ◽

pp. 220

Author(s):

F. N. David ◽

L. A. MacColl

Keyword(s):

Applied Mathematics ◽

American Mathematical Society ◽

Mathematical Society ◽

Applied Probability

Download Full-text

Robert Abernathy. The problem of linguistic equivalence. Structure of language and its mathematical aspects, Proceedings of symposia in applied mathematics, vol. 12, American Mathematical Society, Providence 1961, pp. 95–98.

Journal of Symbolic Logic ◽

10.2307/2269743 ◽

1966 ◽

Vol 31 (4) ◽

pp. 668-668

Author(s):

L. Jonathan Cohen

Keyword(s):

Applied Mathematics ◽

American Mathematical Society ◽

Mathematical Society

Download Full-text

Henry Hiż. Congrammaticality, batteries of transformations and grammatical categories. Structure of language and its mathematical aspects, Proceedings of symposia in applied mathematics, vol. 12, American Mathematical Society, Providence 1961, pp. 43–50. - H. Hiż. The intuitions of grammatical categories. Methodos, vol. 12 (for 1960, pub. 1961), pp. 311–319.

Journal of Symbolic Logic ◽

10.2307/2271264 ◽

1967 ◽

Vol 32 (1) ◽

pp. 115-116

Author(s):

G. H. Matthews

Keyword(s):

Applied Mathematics ◽

American Mathematical Society ◽

Mathematical Society ◽

Grammatical Categories

Download Full-text

The American Mathematical Society and Applied Mathematics

Bulletin of the American Mathematical Society ◽

10.1090/s0002-9904-1947-08820-0 ◽

1947 ◽

Vol 53 (7) ◽

pp. 637-639

Author(s):

J. R. Kline

Keyword(s):

Applied Mathematics ◽

American Mathematical Society ◽

Mathematical Society

Download Full-text

Nuclear Reactor Theory (Proceedings of Symposia in Applied Mathematics, Vol. XI). 339 S. Providence, Rh. I., 1961. American Mathematical Society

ZAMM ‐ Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik ◽

10.1002/zamm.19620420109 ◽

1962 ◽

Vol 42 (1-2) ◽

pp. 84-84

Author(s):

W. Macke

Keyword(s):

Nuclear Reactor ◽

Applied Mathematics ◽

American Mathematical Society ◽

Mathematical Society ◽

Nuclear Reactor Theory

Download Full-text

Proof complexity and feasible arithmetics, DIMACS workshop, April 21–24, 1996, edited by Paul W. Beame and Samuel R. Buss, Series in discrete mathematics and theoretical computer science, vol. 39, American Mathematical Society, Providence1998, xii + 320 pp.

Journal of Symbolic Logic ◽

10.2307/2586816 ◽

1999 ◽

Vol 64 (4) ◽

pp. 1823-1825

Author(s):

Alexander A. Razborov

Keyword(s):

Computer Science ◽

American Mathematical Society ◽

Theoretical Computer Science ◽

Proof Complexity ◽

Mathematical Society ◽

Discrete Mathematics ◽

Theoretical Computer

Download Full-text

Computational complexity theory, edited by Juris Hartmanis, Proceedings of symposia in applied mathematics, vol. 38, American Mathematical Society, Providence1989, ix + 128 pp.

Journal of Symbolic Logic ◽

10.2307/2274929 ◽

1991 ◽

Vol 56 (1) ◽

pp. 335-336

Author(s):

Uwe Schöning

Keyword(s):

Computational Complexity ◽

Complexity Theory ◽

Applied Mathematics ◽

American Mathematical Society ◽

Mathematical Society ◽

Computational Complexity Theory

Download Full-text

M. D. Davis. A note on universal Turing machines. Automata studies, edited by C. E. Shannon and J. McCarthy, Annals of Mathematics studies no. 34, lithoprinted, Princeton University Press, Princeton1956, pp. 167–175. - Martin Davis. The definition of universal Turing machine. Proceedings of the American Mathematical Society, vol. 8 (1957), pp. 1125–1126.

Journal of Symbolic Logic ◽

10.2307/2271485 ◽

1970 ◽

Vol 35 (4) ◽

pp. 590-590

Author(s):

R. J. Nelson

Keyword(s):

Turing Machine ◽

American Mathematical Society ◽

Mathematical Society ◽

Turing Machines ◽

Princeton University ◽

Universal Turing Machine ◽

Definition Of ◽

Martin Davis

Download Full-text