University of Cambridge > Talks.cam > CamPoS (Cambridge Philosophy of Science) seminar > Hacks and explanations via program execution

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Hacks and explanations via program execution

Download to your calendar using vCal

If you have a question about this talk, please contact Matt Farr .

This talk is about hacks – seemingly ad hoc, unprincipled bits of code used to make a program run more efficiently, or, in some cases, simply run at all. Hacks are exceedingly common, but their philosophical significance has not been fully appreciated. First, using an infamous hack for computing fast inverse square roots as a motivating example, I sketch an account of what it is to explain how hacked programs work. On this account, we cannot explain how a hacked program works without reference to facts about a system’s computational architecture and notation. Then, I suggest that this has ramifications for accounts of computational explanation that foreground a system’s abstract causal structure or its semantic properties. The ramification is that these accounts are in trouble.

This talk is part of the CamPoS (Cambridge Philosophy of Science) seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge Usability Group Future Business Centre, King’s Hedges Road, Cambridge, CB4 2HY S1 Alison Richard Building

Other talks

From Plate to Brain: Global Diet, Cognitive Function and Neuroimaging in Diverse Populations "Gods, Monsters & Middle-class Uncles: Indian Comics in a Time between Worlds" A Few Days in Patagonia - the Deep South Afternoon Break Talk TBC Professor Philip Rosenstiel, W3 Professor of Clinical Molecular Biology, Director, Institute of Clinical Molecular Biology (IKMB), Kiel University
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity