CoChat

Classes of recursively enumerable sets and their decision problems

Open access
Rice, H. G. · 1953 · Transactions of the American Mathematical Society

The DOI matches its Crossref record; 12 of the 14 references it cites were found in a registry or an index.

Overview

Integrity signals

Registry

Crossref · 10.1090/s0002-9947-1953-0053041-6

Cites

12 of 12 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 12 references

Cited by

See all 947

Metadata

Authors
Rice, H. G.
Corresponding author
Rice, H. G.
Venue
Transactions of the American Mathematical Society
Published
1953
Volume
74
Issue
2
Pages
358-366
ISSN
  • 0002-9947 (ISSN-L)
  • 1088-6850
OpenAlex
W2047764386
Cited by
869
References
14
Citations by year
2026: 48 · 2025: 48 · 2024: 47 · 2023: 37 · 2022: 32 · 2021: 59 · 2020: 42 · 2019: 38 · 2018: 35 · 2017: 38 · 2016: 34 · 2015: 34 · 2014: 24 · 2013: 25 · 2012: 25
FWCI
7.38
Type
journal article
Language
en
Open access
Locations
Transactions of the American Mathematical Society (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
  • Physical Sciences › Mathematics › Geometry and Topology › Advanced Topology and Set Theory
Keywords
computably enumerable sets, decision problems, computability theory, Turing degrees

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Classes of recursively enumerable sets and their decision problems. https://app.cochat.ai/papers/10.1090/s0002-9947-1953-0053041-6
The paper
Rice, H. G. (1953). Classes of recursively enumerable sets and their decision problems. Transactions of the American Mathematical Society. https://doi.org/10.1090/s0002-9947-1953-0053041-6

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.