The DOI matches its Crossref record.
Theory of Recursive Functions and Effective Computability
Abstract
D. C. Cooper; Theory of Recursive Functions and Effective Computability, The Computer Journal, Volume 12, Issue 1, 1 February 1969, Pages 28, https://doi.o
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
Blackburn, P., Rijke, M. D., & Venema, Y. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9781107050884 · Cited by 1,689
Stockmeyer, L. J. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90061-x · Cited by 1,293
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
Towards a Theory of Declarative Knowledge
Apt, K. R., Blair, H. A., & Walker, A. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50006-3 · Cited by 1,151
Blum, L., Shub, M., & Smale, S. (1989) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1989-15750-9 · Cited by 1,056
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
Inductive inference of formal languages from positive data
Angluin, D. (1980) · Information and Control · doi:10.1016/s0019-9958(80)90285-5 · Cited by 745
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
Baker, T., Gill, J., & Solovay, R. (1975) · SIAM Journal on Computing · doi:10.1137/0204037 · Cited by 738
Computational Complexity of Probabilistic Turing Machines
Gill, J. (1977) · SIAM Journal on Computing · doi:10.1137/0206049 · Cited by 689
Computation theory of cellular automata
Wolfram, S. (1984) · Communications in Mathematical Physics · doi:10.1007/bf01217347 · Cited by 625
The equivalence problem for regular expressions with squaring requires exponential space
Meyer, A. R., & Stockmeyer, L. J. (1972) · 13th Annual Symposium on Switching and Automata Theory (swat 1972) · doi:10.1109/swat.1972.29 · Cited by 596
Structure and complexity of relational queries
Chandra, A., & Harel, D. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90012-5 · Cited by 534
A propositional modal logic of time intervals
Halpern, J. Y., & Shoham, Y. (1991) · Journal of the ACM · doi:10.1145/115234.115351 · Cited by 443
The polynomial hierarchy and a simple model for competitive analysis
Jeroslow, R. G. (1985) · Mathematical Programming · doi:10.1007/bf01586088 · Cited by 425
Unpredictability and undecidability in dynamical systems
Moore, C. (1990) · Physical Review Letters · doi:10.1103/physrevlett.64.2354 · Cited by 414
Quantum mechanical Hamiltonian models of Turing machines
Benioff, P. (1982) · Journal of Statistical Physics · doi:10.1007/bf01342185 · Cited by 402
A comparison of polynomial time reducibilities
Ladner, R. E., Lynch, N. A., & Selman, A. L. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90016-x · Cited by 408
Bennett, C. H., & Gill, J. (1981) · SIAM Journal on Computing · doi:10.1137/0210008 · Cited by 381
Harel, D. (1984) · Handbook of Philosophical Logic · doi:10.1007/978-94-009-6259-0_10 · Cited by 327
A critical review of algorithms in HRM: Definition, theory, and practice
Cheng, M. M., & Hackett, R. D. (2021) · Human Resource Management Review · doi:10.1016/j.hrmr.2019.100698 · Cited by 283
Two notions of correctness and their relation to testing
Budd, T. A., & Angluin, D. (1982) · Acta Informatica · doi:10.1007/bf00625279 · Cited by 260
Randomness conservation inequalities; information and independence in mathematical theories
Levin, L. A. (1984) · Information and Control · doi:10.1016/s0019-9958(84)80060-1 · Cited by 256
The complexity of reasoning about knowledge and time. I. Lower bounds
Halpern, J. Y., & Vardi, M. Y. (1989) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(89)90039-1 · Cited by 252
Computability: An introduction to recursive function theory
Cutland, N. (1980) · doi:10.1017/cbo9781139171496 · Cited by 206
Metadata
- Authors
- Cooper, D. C.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 1969-02-01
- Volume
- 12
- Issue
- 1
- Pages
- 28-28
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2905135108
- Cited by
- 2,539
- References
- 0
- FWCI
- 46.20
- Type
- journal article
- Language
- en
- Open access
- closed
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.