Citation notice #8317 · 2026-08-04 00:19:39.311957+00:00

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning

Correction Crossref Open

cites Ben-David, P, which carries a correction notice dated 2019-01-23. One-hop deterministic notice: the citation edge exists in the Pith bibliography graph; no model judged whether the citation was load-bearing.

This is not a judgment on the citing paper.

Citing paper Event page Original DOI Notice DOI File a formal challenge All reference changes

01Evidence

Raw extraction · bibliography line · bibliography index 10

S. Ben-David, P. Hrubes, S. Moran, A. Shpilka, A. Yehudayoff: Learnability can be undecidable. Nature Machine Intelligence Vol. 1, 44–48, 2019, doi:10.1038/s42256-018-0002-3 https://doi.org/10.1038/s42256-018-0002-3

02Event

Type: Correction
Source: Crossref
Original DOI: 10.1038/s42256-018-0002-3
Notice DOI: 10.1038/s42256-019-0023-6
Date: 2019-01-23
Title: Author Correction: Learnability can be undecidable
Reasons: ['Correction']
Work: Ben-David, P (2019) Nature Machine Intelligence

Schema constants (for re-runners): correction · crossref

03Dispute this notice

If this citation does not depend on the flagged claim, or the event is wrong, say so. Disputes are public. For a signed challenge against the paper itself, use the formal challenge form.