{"slug":"nogo-n03","verification":{"valid":false,"broken_at":0,"reason":"prev mismatch"},"count":3,"sources":[{"id":"s1","type":"primary","url":"https://plato.stanford.edu/entries/goedel/","title":"Gödel 1931 — On Formally Undecidable Propositions","quote":"","summary":"Gödel proved that in any consistent formal system capable of arithmetic, there exist true statements that cannot be proven within the system.","claim_ids":["c1","c4"],"quality_score":0.95},{"id":"s2","type":"primary","url":"https://plato.stanford.edu/entries/turing/","title":"Turing 1936 — On Computable Numbers","quote":"","summary":"Turing proved that no general algorithm can determine whether an arbitrary program halts, establishing fundamental limits on computation.","claim_ids":["c2","c4"],"quality_score":0.95},{"id":"s3","type":"primary","url":"https://en.wikipedia.org/wiki/Rice%27s_theorem","title":"Rice's Theorem (1953)","quote":"","summary":"Rice's theorem states that all non-trivial semantic properties of programs are undecidable, generalizing the halting problem.","claim_ids":["c3","c4"],"quality_score":0.9}]}