|
|
|
|
|
by timeagain
971 days ago
|
|
Related: Why philosophers should care about computational complexity by Scott Aaronson [1]. If you have even a faint interest in philisophy and have taken algorithms 101 you will find something mind-blowing in this paper. My favorite part is about how the “Chinese room” problem takes on totally different character depending on your assumptions about the type of machinery behind the black box. [1] https://www.scottaaronson.com/papers/philos.pdf |
|
The whole thing basically boils down to "there's this room that can speak perfect Chinese, and we don't know how it works, or how your brain works, but somehow we can say with absolute certainly that they couldn't possibly be the same."