« The Computational Theory of the Laws of Nature | Main | Dennett Mele Templeton »

TrackBack

TrackBack URL for this entry:
http://www.typepad.com/services/trackback/6a00d8342025e153ef01a3fcb0448a970b

Listed below are links to weblogs that reference Computation, Laws and Supervenience:

Comments

Daniel Greco

I think the defender of the BSA should welcome the CTL as a precisification of her view. Along those lines, though, I think you overstate some of the differences between the views. You seem to suggest that the BSA defender thinks the nomological accessibility relation is symmetric and transitive, while according to CTL, it's not. But the BSA defender (or at least, the most prominent recent one--David Lewis) doesn't think this, and his reasons for not thinking it are essentially the same ones that are formalized in the CTL. Here's a quote from on the plurality of worlds:

"Then, indeed, puzzling questions about the logic of iterated nomological necessity turn into more tractable questions about the relation of nomological accessibility. Is it symmetric? Transitive? Euclidean? Reflexive?...A theory of lawhood can be expected to answer these questions, and we can see how different theories would answer them differently. (For instance, my own views on lawhood answer all but the last in the negative.)" (p. 20)

I'm inclined to say the same thing about your response to the central anti-humean argument. They strike me more as presifications of things that Humeans standardly say in response to such examples (see, e.g., Helen Beebee's "The Non-Governing Conception of Laws of Nature") rather than fundamentally different responses to such examples that the Humean can give.

Lastly, on simplicity/relativity, I'm just inclined to agree. I think talking about computational complexity lets us relocate and precisify (but not bypass) older debates about the relativity of simplicity. Think, e.g., Goodman on grue--lots of people want to say that the theory that all emeralds are grue is somehow less simple than the theory that all emeralds are green, though familiar arguments from Goodman suggest that whether we get to say this will depend on what language we use. Theories of inductive inference that depend on computational copmlexity (e.g., Solomonoff induction) don't avoid this problem, though they do relocate and precisify it.

tomkow

Daniel,

Thanks for your thoughtful comment! 

I would be very happy if proponents of BSA welcomed CTL. 

I am absolutely content with saying  that CTL  is only a refinement of the guiding ideas behind the Best System Theory.   As I say in the post, you are welcome to think of the CTL as only an updated version of the Best System analysis; one which replaces Euclid's conception of  "System" with Turing's.

And I entirely agree that a BSA theorist can-- and some already have--  endorse the conclusions about the logic of laws that I argue for here.   I hope though that we also agree that CTL gives us useful new ways to think about laws and to argue for these conclusions. . 

I like to think Lewis would have welcomed CTL.  Had he had it to hand, I think he might not (as he did increasingly in his later work) have taken the course of saying  that Humeanism might only be a contingent truth about "worlds like ours".  He was, you will recall, driven to this odd position by cases like Armstrong's spinning sphere. That thought experiment was supposed to show there could be worlds which were indistinguishable in Humean terms but in which had different counterfactual/dispositional properties.  Lewis thought he had to concede the possibility, but he didn't: I think it clear that Armstrong's story fails in the same way as  Carroll's.

And, with all due respect, I do think that CTL does a bit more than just "precisify" the issues confronting BSA. A central problem for BSA is to say not just what, precisely, simplicity is but also to say why it matters.  CTL gives an answer to that question not obviously available to BSA.

I am very pleased to that you are not shocked by the prospect of Nomological Relativity (I can report that some philosophers of my acquaintance find it very shocking indeed).  But here I again I think that CTL does a bit more than just restate the old problems more precisely. 

The problem of "grue" and "green" presents itself as a problem of underdetermination: why inductively project one predicate not the other given the available evidence.  It is, in turn, only stepchild  to the larger problem of Quinean underdetermination: how to choose between contradictory theories equally compatible with all possible evidence. 

As I shall argue in a future post, I think CTL gives us a way of solving these problems by understanding that what is at work here is not underdetermination but relativity.  Relative to some reference machine, a Gruesome description of the world might be simpler than the one we find natural. What properties we find natural may be an evolutionary accident. As Steve Petersen puts it, it is a matter of what Turing Machine evolution has put between our ears. But, as I argue in the post, we need not take this relativity in our judgments as undermining their objectivity

Except relative to some reference machine or other, there is no theorizing about the order of the world. There is no computational, or cognitive, "view from nowhere". And while different points of cognitive/computational view point of can lead to apparently contradictory claims about laws, counterfactuals and dispositions, the appearance of contradiction goes away when we understand that the claims are consistent and commensurable when understood as relative to our cognitive/computational perspective.

Verify your Comment

Previewing your Comment

This is only a preview. Your comment has not yet been posted.

Working...
Your comment could not be posted. Error type:
Your comment has been posted. Post another comment

The letters and numbers you entered did not match the image. Please try again.

As a final step before posting your comment, enter the letters and numbers you see in the image below. This prevents automated programs from posting comments.

Having trouble reading this image? View an alternate.

Working...

Post a comment

Patents