Olympia and Other O-Machines

Colin Klein*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


Against Maudlin, I argue that machines which merely reproduce a pre-programmed series of changes ought to be classed with Turing’s O-Machines even if they would counterfactually show Turing Machine-like activity. This can be seen on an interventionist picture of computational architectures, on which basic operations are the primitive loci for interventions. While constructions like Maudlin’s Olympia still compute, then, claims about them do not threaten philosophical arguments that depend on Turing Machine architectures and their computational equivalents.

Original languageEnglish
Pages (from-to)925-931
Number of pages7
JournalPhilosophia (United States)
Issue number4
Publication statusPublished - 1 Dec 2015


Dive into the research topics of 'Olympia and Other O-Machines'. Together they form a unique fingerprint.

Cite this