Can Church's thesis be viewed as a Carnapian explication?

Turing and Church formulated two different formal accounts of computability that turned out to be extensionally equivalent. Since the accounts refer to different properties they cannot both be adequate conceptual analyses of the concept of computability. This insight has led to a discussion concerning which account is adequate. Some authors have suggested that this philosophical debate-which shows few signs of converging on one view-can be circumvented by regarding Church's and Turing's theses as explications. This move opens up the possibility that both accounts could be adequate, albeit in their own different ways. In this paper, I focus on the question of whether Church's thesis can be seen as an explication in the precise Carnapian sense. Most importantly, I address an additional constraint that Carnap puts on the explicative power of axiomatic systems-an axiomatisation explicates when it is clear which mathematical entities form the theory's intended model-and that implicitly applies to axiomatisations of recursion theory used in Church's account of computability. To overcome this difficulty, I propose two possible clarifications of the pre-systematic concept of "computability" that can both be captured in recursion theory, and I show how both clarifications avoid an objection arising from Carnap's constraint.