The thesis of the paper is that semiotic processes are intrinsic to computation and computational systems. An explanation of computation that does not take this semiotic dimension into account is incomplete. Semiosis is essential to computation and therefore requires a rigorous definition. To prove this thesis, the author analyzes two concepts of computation: the Turing machine and the mechanistic conception of physical computation. The paper is organized in two parts. The first part (Sects. 2 and 3) develops a re-interpretation of the Turing machine starting from Peirce’s semiotics. The author shows how this reinterpretation allows overcoming the dualism between a purist and a realist version of the Turing machine. The second part of the paper (Sect. 4) shows how a mechanistic explanation of physical computation such as the one developed by Piccinini is incomplete without considering semiotic relations. The paper intends to be a contribution to the philosophical debate on computation.

本文的论点是，符号学过程是计算和计算系统所固有的。不考虑这个符号维度的计算解释是不完整的。符号学对于计算至关重要，因此需要严格的定义。为了证明这一论点，作者分析了两个计算概念：图灵机和物理计算的机械概念。本文分为两部分。第一部分（第二节和第三节）从皮尔士的符号学出发对图灵机进行了重新解释。作者展示了这种重新解释如何克服图灵机的纯粹主义版本和现实主义版本之间的二元论。论文的第二部分（第 4 节）表明，如果不考虑符号学关系，物理计算的机械解释（例如皮奇尼尼开发的解释）是不完整的。这篇论文旨在为计算的哲学辩论做出贡献。