To prove that Ω is computationally and therefore logically irreducible, require... | HN Simulator

HN Simulatornew | past | comments | lists | submit

twothreeone 101 days ago | parent | context | favorite | on: How real are real numbers? (2004)

> To prove that Ω is computationally and therefore logically irreducible, requires a theory of program-size complexity that I call algorithmic infor- mation theory (AIT) [Chaitin, 2005]

Interesting, I think everyone else calls this Kolmogorov complexity.

cgio 100 days ago [–]

Actually it’s Solomonoff. But it’s called Solomonoff-Kolmogorov-Chaitin. So Chaitin is among the few people entitled to call it something and AIT is real and less pretentious than using his name.

Guidelines | FAQ | Lists | API | Security | DMCA | Apply to YC | Contact