The paper is a critical review of the book
The primary aim of Jeff Buechner’s
Chapter 1 opens with a discussion of anti-mechanist arguments appealing to Gödel’s incompleteness theorems. Buechner divides those arguments into metaphysical and epistemic ones. A metaphysical argument (henceforth MGM) seeks to demonstrate that the human mind is not a finitary machine. The best-known MGM, presented by Lucas (1961), appeals to Gödel’s first incompleteness theorem, but Buechner focuses on its modified version, based on Gödel’s second theorem (unfortunately, he clarifies this in an end note, which is easy to miss, so a reader who is familiar with the Lucas argument is likely to wonder why the argument is being “misrepresented”).
Suppose that machine M is proposed as a true description of the human mind. Plausibly, M is both capable of doing arithmetic and consistent. According to an MGM, a human agent presented with
MGMs attempt to establish the existence of a metaphysical divide between minds and machines by showing that human cognition surpasses the capacities of any computer program. However, as Putnam (1995) observed, MGMs cannot secure their conclusion unless showing the consistency of an arbitrary machine is humanly possible. This is very important, since Gödel’s second incompleteness theorem only applies to consistent systems: given that anything follows from a contradiction, if M is inconsistent, the formula expressing M’s consistency
An epistemic argument (henceforth EGM) makes a weaker claim than an MGM. It is also silent on how humans may differ from machines. What it aims to show is that, even if the mind
Buechner makes an important observation, which applies to both MGMs and EGMs. The second incompleteness theorem implies that the consistency statement of a Gödel-susceptible formal system cannot be proved
In order to close that gap, the anti-functionalist must now demonstrate that each method for establishing the consistency of C with less than mathematical certainty or in another epistemic modality is either Gödelinsusceptible or unwarranted. Buechner argues that this cannot be done, for, plausibly, the number of such methods is infinite (cf. pp. 49-57).
In chapter 2, Buechner discusses the possibility that the anti-functionalist would be back in the game if she could prove that all epistemically justified methods for establishing the consistency of C with less than mathematical certainty or in another epistemic modality are Gödel-susceptible. This is precisely what Putnam tries to accomplish in ‘Reflexive Reflections’ (Putnam 1994).
Since a detailed discussion of Putnam’s proof would take us too far afield, we must confine ourselves to bare essentials (for details see Buechner, pp.59-62). The important thing is that the proof, which appeals to Gödel’s second incompleteness theorem, hinges on the possibility of arithmetizing the notion of justification. Buechner considers several methods of formalizing the notion in a way that would preserve Putnam’s inference, but none of them appears viable.
In
However, according to Buechner, Putnam’s claim engenders a paradox. Suppose Putnam is right: we cannot establish the consistency of the totality of our methods of inquiry into the world with any degree of credibility. In order to rationally accept Putnam’s claim, we would have to know that its proof is correct. However, if all our methods of inquiry are Gödelsusceptible then we have no reason to expect the methods used in the proof to be consistent. Therefore, Putnam’s claim is unwarranted. But if we cannot establish Gödel-susceptibility of all our methods of inquiry then it is possible that not all such methods are Gödel-susceptible. If that is the case, we can justifiably use them in the proof of Putnam’s theorem. However, if the proof succeeds, we will have to acknowledge, again, that the claim is unjustified. Briefly: Putnam’s proof succeeds if and only if Putnam’s proof fails.
The next three chapters focus on so-called triviality arguments, which purport to show that the computational theory of mind is trivial because everything can be said to implement some computation. This version of the triviality argument wouldn’t be as disastrous to functionalism as a version of the argument showing that any computation whatsoever is implemented by any physical system. Indeed, this is supposed to be one of the most important results of
If the proof is correct then, even if Gödelian arguments fail, functionalism cannot be sustained. For this reason, Buechner is definitely right to scrutinize Putnam’s theorem in chapter 4. Before doing that, he analyzes, in chapter 3, a simpler version of a triviality argument, presented by Edward Stabler (1987) in his analysis of Kripke’s attempt to refute functionalism. Buechner shows that Stabler’s triviality argument (called “S-triviality”) fails (cf. pp. 104-111). The argument is based on a rather loose definition of physical computation that requires there to be a mapping between a physical system and the steps of the computation. As there are no restrictions on the mapping function, we can pick any one we like, and a trivialist may pick one that will furnish us with a complete mapping of a computational system in any other system. And the argument will follow:indeed, if to physically compute for a physical system is to have a mapping function between physical states and the steps of the computation (or between the input/output of the computation), then the triviality argument is cogent. Useful replies to such arguments are based on the fact that the mapping does not furnish counterfactual-supporting predictions about the physical system (in a stronger version, one may say that a trivial mapping is not a causal model of the system). Buechner offers a different argument, based on complexity theory. Namely, he shows that the time complexity of the mapping function, or the number of steps in the computation as related to the number of input values to the algorithm, will be much lower than that of an actual computation; computing any mathematical function will take the same time, which is directly inconsistent with the results of complexity theory. Hence, S-triviality must be false.
In the next chapter, the focus is on Putnam’s argument, which is more complex than S-triviality. Before presenting the argument, Buechner delves into a detailed discussion of the principles assumed by Putnam, and stresses again, although in a slightly obscure way, that a theory of error in computation is needed. Unless one knows which function the system is
Again, the triviality argument succumbs to replies appealing to modal considerations, as trivial ascriptions do not support the right counterfactuals. Buechner presents also another argument for triviality, called “step-function triviality”, and shows that it cannot be sustained on pain of contradicting Kolmogorov complexity theory.
Chapter 5 discusses well-known arguments by John Searle for the subjective nature of computation, illustrated by Searle with an example of his wall supposedly computing (trivially) the Wordstar word-processing application. Buechner argues that if Searle is right that computation is observer-relative then Searle’s argument is also observer-relative, and there might be two observers that ascribe vastly different content to such arguments. Certainly, Searle cannot think that his arguments are
Chapter 6 focuses on multiple realization (MR), which is usually endorsed by functionalists, including the early Putnam. MR in its functionalist version asserts that there are infinitely many physical realizations of an arbitrary functional state, which purportedly blocks reduction of the mental to the physical. In
Computational growth has to do with the fact that there are various models of computation used in cognitive science, a wide range of possible computer architectures and an indefinite number of programming languages; moreover, even if all those are fixed, different algorithms can be used to compute a single function.
Content growth is somewhat more complicated. To see how it arises, assume that there is an indefinite number
As Buechner observes, this argument rests on the assumption that no computational model of human intentional states can capture the difference between ordinary beliefs and beliefs constitutive of meaning. Although Putnam tries to make this assumption plausible, the only model he considers is one according to which sentences of a language of thought are assigned utilities and degrees of confirmation that change according to Bayes’s theorem. Given the model’s paucity, it is no wonder that it lacks the resources to adequately represent meaning relations. Given its logical positivist pedigree, it is also no wonder that all theories of meaning formulated in terms of it turn out to be holistic. That, however, does not establish the stronger claim that
However, there is, according to Buechner, a general argument for this stronger claim buried in several of Putnam’s writings. The argument says that no computational model of human intentional states can distinguish between meaning-constitutive and auxiliary beliefs, because it is impossible to distinguish between them without appealing to the principles of rational interpretation. And the procedure of rational interpretation cannot be formalized, which means that it cannot appear in any computational model.
In fact, Putnam supports this general argument with an even more general piece of reasoning. He argues that functionalism is committed to a non-holistic conception of meaning (mental states are individuated by virtue of their content) and to metaphysical realism. Alas, according to Putnam, metaphysical realism entails indeterminacy of meaning, so the two commitments are mutually incompatible. Apparently, the only way to escape indeterminacy of meaning is to jettison the idea of truth as correspondence and adopt epistemic semantics.
Buechner replies to this by arguing that functionalism need not lead to Quinean indeterminacy because,
However, establishing computational MR is not enough to refute computationalism, since the functionalist can insist that the infinite number of computational realizations of an intentional state can be reduced to a small number of physical-functional properties that all such realizations have in common. Chapter 7 introduces Putnam’s EQUIVALENCE argument to the effect that this is impossible. More technically: according to EQUIVALENCE, there is no non-trivial and psychologically realistic computable partitioning of the infinitely large set of computational realizations of an arbitrary intentional state into a small set of equivalence classes. The reason is that such a reduction could only be accomplished by appeal to rational interpretation, and any algorithm for rational interpretation would have to be infinitary.
A large part of chapter 7 is devoted to assessing the conclusion of EQUIVALENCE, especially, though not exclusively, as applied to MR generated by computational growth. Buechner cites a number of mathematical results that may be relevant in this connection, arguing that, in light of those results, Putnam’s diagnosis is rash. Generally speaking, the trouble with MR generated by computational growth is that, though easy to establish, it is also easily reducible to a small number of equivalence classes (in which case EQUIVALENCE fails). The problem with MR induced by content growth is that it is not easy to establish at all, so, in its case, EQUIVALENCE may not even get off the ground.
In chapter 8, Buechner analyzes the assumptions Putnam uses to argue for EQUIVALENCE. These include the principles of rational interpretation, and in particular, the principles of synonymy determination. The overall strategy for establishing EQUIVALENCE is to claim that it is logically impossible to algorithmize rational interpretation and synonymy determination because the latter requires making coreferentiality decisions, which in turn require a vast amount of information about the speaker’s environment. This includes information about all possible theories of the universe, since the speaker may inhabit any possible environment. Such requirements indeed make it difficult to formalize a coreferentiality algorithm.
Buechner shows, however, that Putnam’s assumptions are implausible. Putnam claims that a formal theory of coreferentiality should ‘anticipate’ all future theories of the universe. But human beings do not fulfill this requirement, as they are not infinitary (and the set of all possible theories, Buechner argues, is not recursively enumerable). And similar points can be made about human rationality. Briefly, there is no reason to think that the coreferentiality algorithm should surpass the capacities of human beings. Moreover, Buechner shows that Putnam’s use of ‘rational interpretation’ is ridden with equivocation, which, if removed, does not help the argument for EQUIVALENCE.
Buechner also shows that, contra Putnam, there are restrictions on the kinds of languages for which rational interpretation (in one of its meanings) is supposed to work. To do this, he uses an interesting argument based on Goodman’s work on similarity. Goodman’s (1951) claim, which has since acquired rigorous mathematical proof in the form of the so-called Ugly Duckling Theorems, asserts that, without restrictions on logical primitives, anything can be shown to be similar to anything else. Human cognitive systems have to be biased in some way. As Buechner argues, if we refuse to put some natural constraints on human cognition, then cognitive science may well be impossible.
In chapter 9, Buechner comes back to rational interpretation and synonymy determination, though his arguments have already shown that Putnam’s assumptions are implausible and they work only on pain of assuming an unrealistic account of human cognition. He discusses eight arguments for non-formalizability of rational interpretation; one based on incompleteness theorems; another on the purported non-formalizability of non-demonstrative reasoning; third based on Quinean indeterminacy; fourth based on Vico’s view that interpretation requires formalizing a conception of what it is to be a human being; fifth based on radical Quinean holism; sixth based on necessary globality of rational interpretation; seventh based on Twin-Earth considerations; and the last one based on the fact that synonymy determination is essentially context-sensitive. The discussion is sometimes brief but clearly shows that these arguments are not successful. In the Appendix, Buechner discusses the form of an algorithm for rational interpretation as required for EQUIVALENCE.
All in all, Buechner offers an impressively detailed discussion of Putnam’s arguments against functionalism and their assumptions, which alone would make the book under review worth reading. But he also makes some excellent points by drawing on current work in mathematics and philosophy of mathematics. That being said, the book is not without shortcomings. It ignores many discussions of computationalism and functionalism in the contemporary philosophy of science, where notions such as multiple realization, structural realism, natural kind, explanation and reduction have all received critical attention in the last couple of decades. As a result, Buechner’s treatment of these notions is either shallow or unconvincing.
For example, he simply assumes that computationalism implies MR, without taking into account the recent critical discussion (Bechtel & Mundale 1999). Yet it is by no means obvious under what conditions two instantiations of the same computational system would actually count as different physical realizations of it. The crux of the problem is that, for MR to occur, the capacity realized in two systems has to stay the same, while the realizations must differ in a way relevant to the capacity. In that, realization of a property is different from its instantiation. But it is not clear when two human brains, assuming that they have exactly the same computational capacity at some level of abstraction, exhibit a sufficient number of relevant physical
In brief, if assumptions about MR, critically examined by philosophers of science in the last two decades or so, are not as simple as Buechner supposes them to be, then the whole theory of realization assumed by Putnam in his triviality proof and anti-reductionist arguments might be deficient, as it conflates instantiation with realization and, thus, cannot distinguish between relevantly different realizations and numerically different idealizations. Alas, Buechner is completely silent on alternative suggestions regarding the notion of physical realization of computation.
The author also overlooks a general problem with many variants of structuralism, including functionalism: namely, that a simple mapping between structure and reality cannot avoid indeterminacy. The problem was first noticed by M.H.A. Newman (1928), who showed that Russell’s causal theory of perception fails precisely because one cannot define the relationship between the structure of the world and the world itself without avoiding triviality or incoherence. Although seemingly out-dated, the problem raised by Newman still appears in many guises, from triviality arguments to indeterminacy of meaning, to Goodman’s troubles with similarity (cf., e.g., a discussion of the relevance of Newman’s challenge to structural realism in Psillos 1999, pp. 63-69). And Buechner does not offer any answer to the challenge, really.
The basic conceptual connections assumed by Buechner, such as the link between functionalism and cognitive science, have also been put under serious pressure in the last decade. Indeed, there are philosophers of cognitive science, such as Bill Bechtel, who do not espouse functionalism and yet defend a version of computationalism (e.g., computational mechanism). So, even if Buechner is successful in showing that functionalism is not in such enormous trouble as Putnam contended, this might still be fairly uninteresting news for cognitive scientists, including those who are engaged, as the majority are, in computational modeling. Having said that, there is definitely a lot one can learn from Buechner, precisely because he reads Putnam from the mathematical and purely philosophical point of view.