|
|
|
|
|
|
by foldr
3022 days ago
|
|
|
Any finite computational system can be implemented as a lookup table in the manner that Searle suggests. But that's not essential to the argument. You can imagine that the man in the room is following instructions for simulating a (finite approximation of) a Turing machine, or any other computational device that you like. |
|
|