- 3,012
- 42
Hi Ferris. Another good write-up!Ferris_bg said:Causal connection:
CC: For all events A and B, A and B are causally connected if and only if they are distinct and either A causes B, B causes A, or A and B are effects of a common cause.
Counterfactual dependence implies causal connection:
CDCC: If A and B are distinct events and B counterfactually depends on A, then A and B are causally connected.
Counterfactual dependence: Effects counterfactually depend on their causes, while causes do not counterfactually depend on their effects and effects of a common cause do not counterfactually depend on one another.
Distinctness means that the events are not identical, neither overlaps the other, and neither implies the other.
Now let's look at the following scenario, where a machine is waiting for some input:
Waiting for input: Input a number N (we press 4):
Event A:
option 1) if N == 4: cause B
option 2) else if N == 7: cause C
option 3) else cause D
We have the following physical activity when we input 4:
A (B | C | D) --[ 4 ]-> B, which can be reduced to: A -> B
Lets remove option 2 now and input 7:
A (B | D) --[ 7 ]-> D, which can again be reduced to: A -> D
Now let's remove option 3, input 4 and see what are the possible results:
A (B) --[ 4 ]-> B? Can we reduce this to A -> B?
case 1) Yes, we can: the computation "if N == 4: cause B" still exist.
case 2) No, we can't: "N == 4" is NOT defined, because the "else condition" is missing. The condition where everything except the number 4 is defined, so that the concept of numbers is still defined. You can't define a single number, without defining the whole concept, so the "else condition" is required.
I'd like to touch on the "else condition" you mention. In Maudlin’s paper, he shows how his beloved Olympia can be provided with all the right causal structure except that he adds “blocks” which don’t touch the machine and don’t interact unless counterfactual information is required, in which case those blocks prevent the machine from operating successfully. He calls this “argument by addition” and “argument by subtraction”. The blocks added are the addition and rusty chains are the subtraction.
In the end, Maudlin concludes:
I would say that Maudlin has concluded that the “else condition” is not a requirement for the creation of mind. He seems to have quite a few supporters in that regard including Zuboff, Hillary Putnam and http://www.gold.ac.uk/computing/staff/m-bishop/" . Mark is an interesting character. Being a professor of cognitive computing, you’d think such a person would naturally be a computationalist, but he’s defended the idea that counterfactuals are not a necessary condition for over a decade now, writing perhaps a dozen or more papers on it.Maudlin said:Olympia has shown us at least that some other level besides the computational must be sought. But, until we have found that level and until we have explicated the relationship between it and computational structure, the belief that pursuit of the pure computationlist program will ever lead to the creation of artificial minds, or to understand the natural ones, remains only a pios hope.
I think the most fundamental problem with the idea of counterfactuals is that people expect computers to be what they define them as. However, computers are symbol manipulation systems, and as such, they are observer relative. There is nothing intrinsic to nature about them.
I’d be interested in your feedback.
Last edited by a moderator:
(...) Well you're downgrading from appeal to authority to simple insults. For the sake of the discussion you started, I hope you'll come to your sense and do something better -adressing my points for example, or the points of anyone not already agreeing with you.