3 ms·
>Personally, I find this response to Searle extremely interesting—since if correct, it suggests that the distinction between polynomial and exponential complexi
by eli_gottlieb 12y ago
>Personally, I find this response to Searle extremely interesting—since if correct, it suggests that the distinction between polynomial and exponential complexity has metaphysical significance.
It's not so much the difference between polynomial and exponential complexity. It's the difference between a coinductive (ie: infinitely looping, like a game loop) computation that adds new information to its "memory" in each iteration (which sounds monadic), compressing its inputs to accommodate that information, and then generating an output... vs a super-exponential lookup table that performs the input-output mappings without actually engaging in any side-effecting or monadic computation at all.
So yes, when you think of these two vastly different ways of writing down a "cognitive-style" computation, it becomes clear that one of them maps relatively well to what we think of when we say "mind", while the other doesn't, and Searle is conveniently eliding the distinction.
- bmh100 12y agoHm why does adding information to memory sound monadic to you? I am not questioning you, but just curious. My knowledge of monads is limited. I would argue that Searle's Chinese Room is posed in a way that presupposes what forms computation might take or the limits it has. Since this was posed decades ago (1980), it makes sense in his time. If Searle had begun teaching today (instead of 1969) and seen convolutional neural networks and recurrent neural networks deployed in massive data centers, Watson win Jeopardy!, neural Turing machines, or a worm's brain emulated and embodied in a small robot, I doubt he would have posed his Chinese Room the same way. Maybe he would not have posed it at all, being convinced in light of those achievements.