Are Computational Transitions Sensitive to Semantics?
Citations Over TimeTop 24% of 2011 papers
Abstract
The formal conception of computation (FCC) holds that computational processes are not sensitive to semantic properties. FCC is popular, but it faces well-known difficulties. Accordingly, authors such as Block and Peacocke pursue a ‘semantically-laden’ alternative, according to which computation can be sensitive to semantics. I argue that computation is insensitive to semantics within a wide range of computational systems, including any system with ‘derived’ rather than ‘original’ intentionality. FCC yields the correct verdict for these systems. I conclude that there is only one promising strategy for semantically-laden theorists: identify special computational systems that help generate their own semantic properties, and then show that computation within those systems is semantically-laden. Unfortunately, the few existing discussions that pursue this strategy are problematic.
Related Papers
- → On collecting semantics for program analysis(2020)4 cited
- → Semantics of communicating processes(1984)21 cited
- → Time in message sequence charts: A formal approach(1997)6 cited
- → Research on Formal Semantics with Networks(2011)
- π-Calculus Based Operational Semantics for Restricted AGENTO(2003)