Competing explanations can be compatible
An explanation of a computer's behaviour in terms of its thinking may be compatible with an explanation in terms of its underlying mechanisms.
For example, a computer that prints payroll checks can be explained both in terms of its physical mechanisms and its abstract program—i.e. these are compatible explanations of the payroll computer's behaviour.

Similarly, the mental and mechanical explanations of a computer that passes the Turing Test may be compatible.

James Moor, 1978.
Immediately related elementsHow this works
-
Artificial Intelligence Â»Artificial Intelligence
Can the Turing Test determine this? [2]  Â»Can the Turing Test determine this? [2] 
Can inductive evidence determine this? Â»Can inductive evidence determine this?
No: induction provides weak evidence Â»No: induction provides weak evidence
Evidence open to different explanation Â»Evidence open to different explanation
Competing explanations can be compatible
James Moor Â»James Moor
+Kommentare (0)
+Verweise (0)
+About