It is not the case that Turing and Chaitin's results on algorithmic information theory show that the descriptive complexity of encoding structured data in single integers grows unboundedly, making the claim practically and theoretically vacuous for sufficiently complex types.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.