The DOI matches its Crossref record.
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
Abstract
In this paper we shall prove three theorems about recursively enumerable sets. The first two answer questions posed by Myhill [1]. The three proofs are independent and can be presented in any order. Certain notations will be common to all three. We shall denote by “R e” the set enumerated by the procedure of which e is the Gödel number. In describing the construction for each proof, we shall suppose that a clerk is carrying out the simultaneous enumeration of R0, R1, R2, …, in such a way that at each step only a finite number of sets have begun to be enumerated and only a finite number of the members of any set have been listed. (One plan the clerk can follow is to turn his attention at Step a to the enumeration of R e where e+1 is the number of prime factors of a. Then each R e receives his attention infinitely often.) We shall denote by “R ea” the set of numbers which, at or before Step a, the clerk has listed as members of R e. Obviously, all the R ea are finite sets, recursive uniformly in e and a. For any a we can determine effectively the highest e for which R ea is not empty, and for any a, e we can effectively find the highest member of R ea, just by scanning what the clerk has done by Step a. Additional notations will be introduced in the proofs to which they pertain.
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
Inductive Inference: Theory and Methods
Angluin, D., & Smith, C. H. (1983) · ACM Computing Surveys · doi:10.1145/356914.356918 · Cited by 887
Computability: An introduction to recursive function theory
Cutland, N. (1980) · doi:10.1017/cbo9781139171496 · Cited by 206
Learning families of algebraic structures from informant
Bazhenov, N., Fokina, E., & San Mauro, L. (2020) · Information and Computation · doi:10.1016/j.ic.2020.104590 · Cited by 14
Metadata
- Authors
- Friedberg, R. M.
- Venue
- Journal of Symbolic Logic
- Publisher
- Cambridge University Press (CUP)
- Published
- 1958-09
- Volume
- 23
- Issue
- 3
- Pages
- 309-316
- ISSN
- 0022-4812 (ISSN-L)
- 1943-5886
- OpenAlex
- W2127316662
- Cited by
- 247
- References
- 0
- FWCI
- 0.78
- 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.