Scott Aaronson has an interesting take on the Chinese room theorem that tackles it from a computational complexity point of view: Let's say this Chinese rule b

Scott Aaronson has an interesting take on the Chinese room theorem that tackles it from a computational complexity point of view: Let's say this Chinese rule book does exist, and that it can provide an answer to every single possible question asked it. It would need to have an answer for every possible combination of words in the Chinese language. This is an unimaginably large amount of data. There are more combinations than there are atoms in the universe. This book and room simply can't exist as a 'Lookup'. Even if it did, you would need robots flying around at the speed of light retrieving information. I wouldn't have trouble calling such a system intelligent. So if this room were to exist, and was a reasonable size, then there must be some incredible intelligence involved in scaling it down to this size. He talks about it in his book: Quantum Computing Since Democritus.