Gualtiero Piccinini

Knowledge is factually grounded belief. This account uses the same ingredients as the traditional analysis—belief, truth, and justification—but posits a different relation between them. While the traditional analysis begins with true belief and improves it by simply adding justification, this account begins with belief, improves it by grounding it, and then improves it further by grounding it in the facts. In other words, for a belief to be knowledge, it's not enough that it be true and justified; for a belief to be knowledge, it must be justified by the facts. This account solves the Gettier problem. Gettierized beliefs fall short of knowledge because, albeit true and justified, they are not grounded in the facts. This account also elucidates why knowledge attributions are sensitive to epistemic standards. It's because whether we take a belief to be grounded in the facts is sensitive to epistemic standards.

It’s fashionable to maintain that in the near future we can become immortal by uploading our minds to artificial computers. Mind uploading requires three assumptions: that we can construct realistic computational simulations of human brains; that realistic computational simulations of human brains would have conscious minds like those possessed by the brains being simulated; that the minds of the simulated brains survive through the simulation. I will argue that the first two assumptions are implausible and the third is false. Therefore, we will not upload our mind to computers and, most likely, we will not upload anything resembling our mind to computers.

I argue that wholes are neither identical to nor distinct from their parts. Instead, wholes are invariants under some transformations in their parts. Similarly, higher-level properties are neither identical to nor distinct from their lower-level realizers. Instead, higher-level properties are aspects of their realizers that are invariant under some transformations in their realizers. Nowhere in this picture is there any ontological hierarchy between levels of composition or realization. Neither wholes nor their parts are more fundamental. Neither is prior. Neither reduces to the other. Neither is eliminated. Ditto for higher-level properties and their lower-level realizers. Instead, wholes and their properties as well as parts and their properties are different yet invariant aspects of reality. The result is an egalitarian account of composition and realization.

We define mereologically invariant composition as the relation between a whole object and its parts when the object retains the same parts during a time interval. We argue that mereologically invariant composition is identity between a whole and its parts taken collectively. Our reason is that parts and wholes are equivalent measurements of a portion of reality at different scales in the precise sense employed by measurement theory. The purpose of these scales is the numerical representation of primitive relations between quantities of being. To show this, we prove representation and uniqueness theorems for composition. Thus, mereologically invariant composition is trans-scalar identity.

We situate the debate on intentionality within the rise of cognitive neuroscience and argue that cognitive neuroscience can explain intentionality. We discuss the explanatory significance of ascribing intentionality to representations. At first, we focus on views that attempt to render such ascriptions naturalistic by construing them in a deflationary or merely pragmatic way. We then contrast these views with staunchly realist views that attempt to naturalize intentionality by developing theories of content for representations in terms of information and biological function. We echo several other philosophers by arguing that these theories over-generalize unless they are constrained by a theory of the functional role of representational vehicles. This leads to a discussion of the functional roles of representations, and how representations might be realized in the brain. We argue that there’s work to be done to identify a distinctively mental kind of representation. We close by sketching a way forward for the project of naturalizing intentionality. This will not be achieved simply by ascribing the content of mental states to generic neural representations, but by identifying specific neural representations that explain the puzzling intentional properties of mental states.

We propose a novel account of the distinction between innate and acquired biological traits: biological traits are innate to the degree that they are caused by factors intrinsic to the organism at the time of its origin; they are acquired to the degree that they are caused by factors extrinsic to the organism. This account borrows from recent work on causation in order to make rigorous the notion of quantitative contributions to traits by different factors in development. We avoid the pitfalls of previous accounts and argue that the distinction between innate and acquired traits is scientifically useful. We therefore address not only previous accounts of innateness but also skeptics about any account. The two are linked, in that a better account of innateness also enables us better to address the skeptics.

We argue that there are two different kinds of altruistic motivation: classical psychological altruism, which generates ultimate desires to help other organisms at least partly for those organisms’ sake, and nonclassical psychological altruism, which generates ultimate desires to help other organisms for the sake of the organism providing the help. We then argue that classical psychological altruism is adaptive if the desire to help others is intergenerationally reliable and, thus, need not be learned. Nonclassical psychological altruism is adaptive when the desire to help others is adaptively learnable. This theory opens new avenues for the interdisciplinary study of psychological altruism.

According to pancomputationalism, all physical systems – atoms, rocks, hurricanes, and toasters – perform computations. Pancomputationalism seems to be increasingly popular among some philosophers and physicists. In this paper, we interpret pancomputationalism in terms of computational descriptions of varying strength—computational interpretations of physical microstates and dynamics that vary in their restrictiveness. We distinguish several types of pancomputationalism and identify essential features of the computational descriptions required to support them. By tying various pancomputationalist theses directly to notions of what counts as computation in a physical system, we clarify the meaning, strength, and plausibility of pancomputationalist claims. We show that the force of these claims is diminished when weaknesses in their supporting computational descriptions are laid bare. Specifically, once computation is meaningfully distinguished from ordinary dynamics, the most sensational pancomputationalist claims are unwarranted, whereas the more modest claims offer little more than recognition of causal similarities between physical processes and the most primitive computing processes.

We provide an explicit taxonomy of legitimate kinds of abstraction within constitutive explanation. We argue that abstraction is an inherent aspect of adequate mechanistic explanation. Mechanistic explanations—even ideally complete ones—typically involve many kinds of abstraction and therefore do not require maximal detail. Some kinds of abstraction play the ontic role of identifying the specific complex components, subsets of causal powers, and organizational relations that produce a suitably general phenomenon. Therefore, abstract constitutive explanations are both legitimate and mechanistic.

Computationalism says that brains are computing mechanisms, that is, mechanisms that perform computations. At present, there is no consensus on how to formulate computationalism precisely or adjudicate the dispute between computationalism and its foes, or between different versions of computationalism. An important reason for the current impasse is the lack of a satisfactory philosophical account of computing mechanisms. The main goal of this dissertation is to offer such an account.
I also believe that the history of computationalism sheds light on the current debate. By tracing different versions of computationalism to their common historical origin, we can see how the current divisions originated and understand their motivation. Reconstructing debates over computationalism in the context of their own intellectual history can contribute to philosophical progress on the relation between brains and computing mechanisms and help determine how brains and computing mechanisms are alike, and how they differ. Accordingly, my dissertation is divided into a historical part, which traces the early history of computationalism up to 1946, and a philosophical part, which offers an account of computing mechanisms.
The two main ideas developed in this dissertation are that (1) computational states are to be identified functionally not semantically, and (2) computing mechanisms are to be studied by functional analysis. The resulting account of computing mechanism, which I call the functional account of computing mechanisms, can be used to identify computing mechanisms and the functions they compute. I use the functional account of computing mechanisms to taxonomize computing mechanisms based on their different computing power, and I use this taxonomy of computing mechanisms to taxonomize different versions of computationalism based on the functional properties that they ascribe to brains. By doing so, I begin to tease out empirically testable statements about the functional organization of the brain that different versions of computationalism are committed to. I submit that when computationalism is reformulated in the more explicit and precise way I propose, the disputes about computationalism can be adjudicated on the grounds of empirical evidence from neuroscience.

This article defends a modest version of the Physical Church-Turing thesis (CT). Following an established recent trend, I distinguish between what I call Mathematical CT—the thesis supported by the original arguments for CT—and Physical CT. I then distinguish between bold formulations of Physical CT, according to which any physical process—anything doable by a physical system—is computable by a Turing machine, and modest formulations, according to which any function that is computable by a physical system is computable by a Turing machine. I argue that Bold Physical CT is not relevant to the epistemological concerns that motivate CT and hence not suitable as a physical analog of Mathematical CT. The correct physical analog of Mathematical CT is Modest Physical CT. I propose to explicate the notion of physical computability in terms of a usability constraint, according to which for a process to count as relevant to Physical CT, it must be usable by a finite observer to obtain the desired values of a function. Finally, I suggest that proposed counterexamples to Physical CT are still far from falsifying it because they have not been shown to satisfy the usability constraint.

A common presupposition in the concepts literature is that concepts constitute a sin- gular natural kind. If, on the contrary, concepts split into more than one kind, this literature needs to be recast in terms of other kinds of mental representation. We offer two new arguments that concepts, in fact, divide into different kinds: (a) concepts split because different kinds of mental representation, processed independently, must be posited to explain different sets of relevant phenomena; (b) concepts split because different kinds of mental representation, processed independently, must be posited to explain responses to different kinds of category. Whether these arguments are sound remains an open empirical question, to be resolved by future empirical and theoretical work.

Computationalism has been the mainstream view of cognition for decades. There are periodic reports of its demise, but they are greatly exaggerated. This essay surveys some recent literature on computationalism. It concludes that computationalism is a family of theories about the mechanisms of cognition. The main relevant evidence for testing it comes from neuroscience, though psychology and AI are relevant too. Computationalism comes in many versions, which continue to guide competing research programs in philosophy of mind as well as psychology and neuroscience. Although our understanding of computationalism has deepened in recent years, much work in this area remains to be done

Abstract: According to the Veridicality Thesis, information requires truth. On this view, smoke carries information about there being a fire only if there is a fire, the proposition that the earth has two moons carries information about the earth having two moons only if the earth has two moons, and so on. We reject this Veridicality Thesis. We argue that the main notions of information used in cognitive science and computer science allow A to have information about the obtaining of p even when p is false.

This paper offers an account of what it is for a physical system to be a computing mechanism—a mechanism that performs computations. A computing mechanism is any mechanism whose functional analysis ascribes it the function of generating outputs strings from input strings in accordance with a general rule that applies to all strings. This account is motivated by reasons that are endogenous to the philosophy of computing, but it may also be seen as an application of recent literature on mechanisms. The account can be used to individuate computing mechanisms and the functions they compute and to taxonomize computing mechanisms based on their computing power. This makes it ideal for grounding the comparison and assessment of computational theories of mind and brain.

This paper concerns Alan Turing’s ideas about machines, mathematical methods of proof, and intelligence. By the late 1930s, Kurt Gödel and other logicians, including Turing himself, had shown that no finite set of rules could be used to generate all true mathematical statements. Yet according to Turing, there was no upper bound to the number of mathematical truths provable by intelligent human beings, for they could invent new rules and methods of proof. So, the output of a human mathematician, for Turing, was not a computable sequence (i.e., one that could be generated by a Turing machine). Since computers only contained a finite number of instructions (or programs), one might argue, they could not reproduce human intelligence. Turing called this the “mathematical
objection” to his view that machines can think. Logico-mathematical reasons, stemming from his own work, helped to convince Turing that it should be possible to reproduce human intelligence, and eventually compete with it, by developing the appropriate kind of digital computer. He felt it
should be possible to program a computer so that it could learn or discover new rules, overcoming the limitations imposed by the incompleteness and undecidability results in the same way that human
mathematicians presumably do.

Gualtiero Piccinini articulates and defends a mechanistic account of concrete, or physical, computation. A physical system is a computing system just in case it is a mechanism one of whose functions is to manipulate vehicles based solely on differences between different portions of the vehicles according to a rule defined over the vehicles. Physical Computation discusses previous accounts of computation and argues that the mechanistic account is better. Many kinds of computation are explicated, such as digital vs. analog, serial vs. parallel, neural network computation, program-controlled computation, and more. Piccinini argues that computation does not entail representation or information processing although information processing entails computation. Pancomputationalism, according to which every physical system is computational, is rejected. A modest version of the physical Church-Turing thesis, according to which any function that is physically computable is computable by Turing machines, is defended.