A properly designed Chinese room is Turing complete
If we assume the Chinese room contains a pencil, an eraser and sufficient paper, the Chinese room has all the necessary equipment to function as a Turing machine. A Turing machine is Turing-complete. Therefore the Chinese room is Turing complete.
A Turing-complete machine can simulate the behavior of any other digital machine. As Alan Turing writes, "All digital compuaters are in a sense equivalent." (Turing 1950, p. 442)
The Turing-completeness of the Chinese room implies that:
If there exists a program which can simulate intelligent behavior, then the Chinese room can simulate intelligent behavior.
Also, interestingly, it imples that:
If the Chinese room can not simulate intelligent behavior, then there is no program that can simulate intelligent behavior.
Any argument that claims to show that the Chinese room can not simulate intelligent behavior, shows that AI is impossible.