A simplicity criterion for physical computation

DOI10.1093/BJPS/AXX046MaRDI QIDQ5210600zbMATH OpenOpenAlexFDO

Authors Tyler Millhouse

Publication date 21 January 2020

Published in The British Journal for the Philosophy of Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/bjps/axx046

Mathematics Subject Classification ID

General topics in the theory of computing (68Q01) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Physical computation. A mechanistic account
• Computational versus causal complexity
• When does a physical system compute?
• Against structuralist theories of computational implementation
• Computationalism

Cited in

(3)

• Concrete digital computation: what does it take for a physical system to compute?
• Computational versus causal complexity
• When does a physical system compute?

This page was built for publication: A simplicity criterion for physical computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210600)