Elements of the Theory of Computation
Open accessThe DOI matches its Crossref record.
Abstract
Preface to the First Edition (
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Stanford encyclopedia of philosophy: a dynamic reference work
Nodelman, U., Allen, C., & Zalta, E. N. (2002) · Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries · doi:10.1145/544220.544327 · Cited by 1,988
Collaboration Processes: Inside the Black Box
Thomson, A. M., & Perry, J. L. (2006) · Public Administration Review · doi:10.1111/j.1540-6210.2006.00663.x · Cited by 1,386
The Complexity of Markov Decision Processes
Papadimitriou, C. H., & Tsitsiklis, J. N. (1987) · Mathematics of Operations Research · doi:10.1287/moor.12.3.441 · Cited by 1,329
Self-citationLinear-time algorithms for testing the satisfiability of propositional horn formulae
Dowling, W. F., & Gallier, J. H. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90014-1 · Cited by 1,013
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Shock Graphs and Shape Matching
Siddiqi, K., Shokoufandeh, A., Dickinson, S. J., & Zucker, S. W. (1999) · International Journal of Computer Vision · doi:10.1023/a:1008102926703 · Cited by 756
Tools for Inventing Organizations: Toward a Handbook of Organizational Processes
Malone, T. W., Crowston, K., Lee, J., Pentland, B., Dellarocas, C., Wyner, G., Quimby, J., Osborn, C. S., Bernstein, A., Herman, G., et al. (1999) · Management Science · doi:10.1287/mnsc.45.3.425 · Cited by 755
The calculi of emergence: computation, dynamics and induction
Crutchfield, J. P. (1994) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(94)90273-9 · Cited by 754
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
Kozen, D. (1994) · Information and Computation · doi:10.1006/inco.1994.1037 · Cited by 634
A Gentle Introduction to Memetic Algorithms
Moscato, P., & Cotta, C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_5 · Cited by 457
Concepts and paradigms of object-oriented programming
Wegner, P. (1990) · ACM SIGPLAN OOPS Messenger · doi:10.1145/382192.383004 · Cited by 439
Spong (1998) · doi:10.1007/bfb0015081 · Cited by 437
“One can embed a universal Turing machine into a hybrid system so that the stability question can reduce, in the worst case, to the halting problem [19], which is known to be undecidable.”
On the power of quantum finite state automata
Kondacs, A., & Watrous, J. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646094 · Cited by 346
The Tractable Cognition Thesis
Van Rooij, I. (2008) · Cognitive Science · doi:10.1080/03640210801897856 · Cited by 285
The protein threading problem with sequence amino acid interaction preferences is NP-complete
Lathrop, R. H. (1994) · "Protein Engineering, Design and Selection" · doi:10.1093/protein/7.9.1059 · Cited by 276
Inclusion dependencies and their interaction with functional dependencies
Casanova, M. A., Fagin, R., & Papadimitriou, C. H. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90075-8 · Cited by 260
Self-citationStacksplorer: call graph navigation helps increasing code maintenance efficiency
Karrer, T., Krämer, J.-P., Diehl, J., Hartmann, B., & Borchers, J. (2011) · Proceedings of the 24th annual ACM symposium on User interface software and technology · doi:10.1145/2047196.2047225 · Cited by 48
Metadata
- Authors
- Lewis, H. R., & Papadimitriou, C. H.
- Venue
- ACM SIGACT News
- Published
- 1998-09
- Volume
- 29
- Issue
- 3
- Pages
- 62-78
- ISSN
- 0163-5700 (ISSN-L)
- OpenAlex
- W2331953749
- Cited by
- 1,040
- References
- 0
- FWCI
- 50.72
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.