{"slug":"thinker-gregory-chaitin","verification":{"valid":true,"entries":3,"head":"31bf2970185cb7075784fbef5a0eaef929fea9c91cbb2ac1b0babf34ec149283"},"count":3,"sources":[{"id":"s1","type":"other","url":"https://en.wikipedia.org/wiki/Chaitin%27s_constant","title":"Chaitin's constant","quote":"a real number that, informally speaking, represents the probability that a randomly constructed program will halt","summary":"Defines Ω and states its uncomputability.","claim_ids":["c1","c3"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-07T07:06:55.009Z","link_status":"ok","quote_status":"unverified","prev":"genesis","hash":"bd787a9c5ef7b8bf1a227021718f58e2012ed4cdbd475f6dfb128e91277e6ac0"},{"id":"s2","type":"other","url":"https://dl.acm.org/doi/10.1145/321356.321363","title":"On the Length of Programs for Computing Finite Binary Sequences","quote":"The use of Turing machines for computing finite binary sequences","summary":"1966 foundational paper by Gregory J. Chaitin in JACM.","claim_ids":["c2"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-07T07:06:55.009Z","link_status":"http_403","quote_status":"unverified","prev":"bd787a9c5ef7b8bf1a227021718f58e2012ed4cdbd475f6dfb128e91277e6ac0","hash":"f6d850c637f1a23078512684d4df285abc4e8c2592fa4ca5a09258cd63c53452"},{"id":"s3","type":"other","url":"https://mathworld.wolfram.com/ChaitinsConstant.html","title":"Chaitin's Constant","quote":"introduced by Chaitin (1975)","summary":"Lists primary references including the 1975 paper and 2005 book.","claim_ids":["c4"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-07T07:06:55.009Z","link_status":"ok","quote_status":"verified","prev":"f6d850c637f1a23078512684d4df285abc4e8c2592fa4ca5a09258cd63c53452","hash":"31bf2970185cb7075784fbef5a0eaef929fea9c91cbb2ac1b0babf34ec149283"}]}