This objection is silly. Of course if you define an encoding that maps '3' to 'the contents of all books', then you've trivially found a way to encode it in pi. But I think you're aware that the intention of the question is to find an encoding that has comparable complexity to the text of all books.
Specifically, the property we want is that if some substring of the digits of pi encodes 'all books', then you should be able to extract certain books out of substrings of that block of pi. I don't know if there's a technical term for that, but it's clear that we're imagining encoding successive paragraphs of these books in successive blocks of digits in pi.
Comments
This objection is silly. Of course if you define an encoding that maps '3' to 'the contents of all books', then you've trivially found a way to encode it in pi. But I think you're aware that the intention of the question is to find an encoding that has comparable complexity to the text of all books.
Specifically, the property we want is that if some substring of the digits of pi encodes 'all books', then you should be able to extract certain books out of substrings of that block of pi. I don't know if there's a technical term for that, but it's clear that we're imagining encoding successive paragraphs of these books in successive blocks of digits in pi.