The free energy principle, an influential framework in computational neuroscience and theoretical neurobiology, starts from the assumption that living systems ensure adaptive exchanges with their environment by minimizing the objective function of variational free energy. Following this premise, it claims to deliver a promising integration of the life sciences. In recent work, Markov blankets, one of the central constructs of the free energy principle, have been applied to resolve debates central to philosophy (such as demarcating the boundaries of the mind). The aim of this paper is twofold. First, we trace the development of Markov blankets starting from their standard application in Bayesian networks, via variational inference, to their use in the literature on active inference. We then identify a persistent confusion in the literature between the formal use of Markov blankets as an epistemic tool for Bayesian inference, and their novel metaphysical use in the free energy framework to demarcate the physical boundary between an agent and its environment. Consequently, we propose to distinguish between “Pearl blankets” to refer to the original epistemic use of Markov blankets and “Friston blankets” to refer to the new metaphysical construct. Second, we use this distinction to critically assess claims resting on the application of Markov blankets to philosophical problems. We suggest that this literature would do well in differentiating between two different research programmes: “inference with a model” and “inference within a model.” Only the latter is capable of doing metaphysical work with Markov blankets, but requires additional philosophical premises and cannot be justified by an appeal to the success of the mathematical framework alone.

Shagrir ([2001]) and Sprevak ([2010]) explore the apparent necessity of representation for the individuation of digits (and processors) in computational systems.(1) I will first offer a response to Sprevak's argument that does not mention Shagrir's original formulation, which was more complex. I then extend my initial response to cover Shagrir's argument, thus demonstrating that it is possible to individuate digits in non-representational computing mechanisms. I also consider the implications that the non-representational individuation of digits would have for the broader theory of computing mechanisms.

The aim of this paper is to begin developing a version of Gualtiero Piccinini’s mechanistic account of computation that does not need to appeal to any notion of proper (or teleological) functions. The motivation for doing so is a general concern about the role played by proper functions in Piccinini’s account, which will be evaluated in the first part of the paper. I will then propose a potential alternative approach, where computing mechanisms are understood in terms of Carl Craver’s perspectival account of mechanistic functions. According to this approach, the mechanistic function of ‘performing a computation’ can only be attributed relative to an explanatory perspective, but such attributions are nonetheless constrained by the underlying physical structure of the system in question, thus avoiding unlimited pancomputationalism. If successful, this approach would carry with it fewer controversial assumptions than Piccinini’s original account, which requires a robust understanding of proper functions. Insofar as there are outstanding concerns about the status of proper functions, this approach would therefore be more generally acceptable.

In this paper we will demonstrate that a computational system can meet the criteria for autonomy laid down by classical enactivism. The two criteria that we will focus on are operational closure and structural determinism, and we will show that both can be applied to a basic example of a physically instantiated Turing machine. We will also address the question of precariousness, and briefly suggest that a precarious Turing machine could be designed. Our aim in this paper is to challenge the assumption that computational systems are necessarily heteronomous systems, to try and motivate in enactivism a more nuanced and less rigid conception of computational systems, and to demonstrate to computational theorists that they might find some interesting material within the enactivist tradition, despite its historical hostility towards computationalism.

Post-cognitive approaches to cognitive science, such as enactivism and autopoietic theory, are typically assumed to involve the rejection of computationalism. We will argue that this assumption results from the conflation of computation with the notion of representation, which is ruled out by the post-cognitivist rejection of cognitive realism. However, certain theories of computation need not invoke representation, and are not committed to cognitive realism, meaning that post-cognitivism need not necessarily imply anti-computationalism. Finally, we will demonstrate that autopoietic theory shares a mechanistic foundation with these theories of computation, and is therefore well-equipped to take advantage of these theories.

The past few years have seen several novel information-theoretic measures of causal emergence developed within the scientific community. In this paper I will introduce one such measure, called ‘effective information’, and describe how it is used to argue for causal emergence. In brief, the idea is that certain kinds of complex system are structured such that an intervention characterised at the macro-level will be more informative than one characterised at the micro-level, and that this constitutes a form of causal emergence. Having introduced this proposal, I will then assess the extent to which it is genuinely ‘causal’ and/or ‘emergent’, and argue that it supports only an epistemic form of causal emergence that is not as exciting as it first seems.