J. Hartmanis and J. E. Hopcroft. What makes some language theory problems undecidable. Journal of computer and system sciences, vol. 4 , pp. 368–376 [Book Review]

Journal of Symbolic Logic 40 (2):245-246 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271922

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,574

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: J. Hartmanis, J. E. Hopcroft, What Makes Some Language Theory Problems Undecidable. [REVIEW]Patrick C. Fischer - 1975 - Journal of Symbolic Logic 40 (2):245-246.
What Makes Some Language Theory Problems Undecidable.J. Hartmanis & J. E. Hopcroft - 1975 - Journal of Symbolic Logic 40 (2):245-246.
Hartmanis J. and Lewis F. D.. The use of lists in the study of undecidable problems in automata theory. Journal of computer and system sciences, vol. 5 , pp. 54–66. [REVIEW]Dennis F. Cudia - 1974 - Journal of Symbolic Logic 39 (2):347-347.
The Use of Lists in the Study of Undecidable Problems in Automata Theory.J. Hartmanis & F. D. Lewis - 1974 - Journal of Symbolic Logic 39 (2):347-347.
Review: J. Hartmanis, F. D. Lewis, The Use of Lists in the Study of Undecidable Problems in Automata Theory. [REVIEW]Dennis F. Cudia - 1974 - Journal of Symbolic Logic 39 (2):347-347.
Generic Complexity of Undecidable Problems.Alexei G. Myasnikov & Alexander N. Rybalov - 2008 - Journal of Symbolic Logic 73 (2):656 - 673.
Typability and type checking in System F are equivalent and undecidable.J. B. Wells - 1999 - Annals of Pure and Applied Logic 98 (1-3):111-156.
The Π₃-Theory of the [image] -Enumeration Degrees Is Undecidable.Thomas F. Kent - 2006 - Journal of Symbolic Logic 71 (4):1284 - 1302.
Comments on `two undecidable problems of analysis'.Bruno Scarpellini - 2003 - Minds and Machines 13 (1):79-85.
The Π₃-Theory of the $\Sigma _{2}^{0}$ -Enumeration Degrees Is Undecidable.Thomas F. Kent - 2006 - Journal of Symbolic Logic 71 (4):1284 - 1302.
Two undecidable problems of analysis.Bruno Scarpellini - 2003 - Minds and Machines 13 (1):49-77.
First-order Frege theory is undecidable.Warren Goldfarb - 2001 - Journal of Philosophical Logic 30 (6):613-616.
Jeffrey D. Ullman. Principles of database systems. Second edition. Computer software engineering series. Computer Science Press, Rockville, Md., 1982, vii + 484 pp. - David Maier. The theory of relational databases. Computer Science Press, Rockville, Md., 1983, xv + 637 pp. - Ashok K. Chandra and David Harel. Computable queries for relational data bases. Journal of computer and system sciences, vol. 21 , pp. 156–178. [REVIEW]J. A. Makowsky - 1986 - Journal of Symbolic Logic 51 (4):1079-1084.
Patrick C. Fischer, Albert R. Meyer, and Arnold L. Rosenberg. Time-restricted sequence generation. Journal of computer and system sciences, vol. 4 , pp. 50–73. [REVIEW]Jiˇrí Bečvář - 1975 - Journal of Symbolic Logic 40 (4):616-617.
Oliver Aberth. The concept of effective method applied to computational problems of linear algebra. Journal of computer and system sciences, vol. 5 , pp. 17–25. [REVIEW]Brian H. Mayoh - 1975 - Journal of Symbolic Logic 40 (1):84.

Analytics

Added to PP
2016-06-30

Downloads
18 (#839,032)

6 months
3 (#984,719)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references