The mechanistic account of computation offers one promising and influential theory of computational implementation. The aim of this paper is to shore up its conceptual foundations by responding to several recent challenges. After outlining and responding to a recent proposal from Kuokkanen (Synthese 200:247, 2022a), I suggest that computational description should be conceptualised as a form of idealisation (selectively attending to modified subsets of model features) rather than abstraction (selectively attending to subsets of features within a target system). I argue that this conceptualisation not only offers the best way of making sense of computational implementation, but also a way of resolving each of the outstanding challenges facing the mechanistic account. The idealisation view allows the mechanistic account to make sense of the omission process found in computational descriptions without leaving the relationship between physical and computational properties mysterious.

计算的机械解释提供了一种有前途且有影响力的计算实现理论。本文的目的是通过应对最近的一些挑战来巩固其概念基础。在概述并回应 Kuokkanen 最近的提案（Synthese 200:247, 2022a）之后，我建议计算描述应该被概念化为一种理想化形式（选择性地关注模型特征的修改子集）而不是抽象（选择性地关注子集）目标系统中的功能）。我认为，这种概念化不仅提供了理解计算实现的最佳方式，而且还提供了解决机械解释面临的每个突出挑战的方法。理想化观点允许机械论解释计算描述中发现的遗漏过程，而不会使物理和计算属性之间的关系变得神秘。