more on this theme     |     more from this text


Single Idea 2577

[filed under theme 18. Thought / B. Mechanics of Thought / 6. Artificial Thought / b. Turing Machines ]

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.

Gist of Idea

Simple machine-functionalism says mind just is a Turing machine

Source

Ned Block (Troubles with Functionalism [1978], p. 70)

Book Ref

'The Philosophy of Mind', ed/tr. Beakley,B /Ludlow P [MIT 1992], 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.


The 16 ideas from Ned Block

The Inverted Earth example shows that phenomenal properties are not representational [Block, by Rowlands]
The meaning of a representation is its role in thought, perception or decisions [Block]
Behaviour requires knowledge as well as dispositions [Block]
In functionalism, desires are internal states with causal relations [Block]
Functionalism is behaviourism, but with mental states as intermediaries [Block]
Could a creature without a brain be in the right functional state for pain? [Block]
Simple machine-functionalism says mind just is a Turing machine [Block]
A Turing machine, given a state and input, specifies an output and the next state [Block]
Physicalism is prejudiced in favour of our neurology, when other systems might have minds [Block]
Intuition may say that a complex sentence is ungrammatical, but linguistics can show that it is not [Block]
A brain looks no more likely than anything else to cause qualia [Block]
You might invert colours, but you can't invert beliefs [Block]
Lobotomised patients can cease to care about a pain [Block]
Not just any old functional network will have mental states [Block]
In functionalism, what are the special inputs and outputs of conscious creatures? [Block]
A fast machine could pass all behavioural tests with a vast lookup table [Block, by Rey]