display all the ideas for this combination of philosophers
3 ideas
| 2577 | Simple machine-functionalism says mind just is a Turing machine [Block] |
| Full Idea: In the simplest Turing-machine version of functionalism (Putnam 1967), mental states are identified with the total Turing-machine state, involving a machine table and its inputs and outputs. | |
| From: Ned Block (Troubles with Functionalism [1978], p. 70) | |
| A reaction: This obviously invites the question of why mental states would be conscious and phenomenal, given that modern computers are devoid of same, despite being classy Turing machines. |
| 2580 | A Turing machine, given a state and input, specifies an output and the next state [Block] |
| Full Idea: In a Turing machine, given any state and input, the machine table specifies an output and the next state. …To have full power the tape must be infinite in at least one direction, and be movable in both directions. | |
| From: Ned Block (Troubles with Functionalism [1978], p. 71) | |
| A reaction: In retrospect, the proposal that this feeble item should be taken as a model for the glorious complexity and richness of human consciousness doesn't look too plausible. |
| 3178 | A fast machine could pass all behavioural tests with a vast lookup table [Block, by Rey] |
| Full Idea: Ned Block proposes a machine (a 'blockhead') which could pass the Turing Test just by looking up responses in a vast look-up table. | |
| From: report of Ned Block (works [1984]) by Georges Rey - Contemporary Philosophy of Mind 5.3 | |
| A reaction: Once you suspected you were talking to a blockhead, I think you could catch it out in a Turing Test. How can the lookup table keep up to date with immediate experience? Ask it about your new poem. |