A critical survey of some attempts to define ‘computer’, beginning with some informal ones, then critically evaluating those of three philosophers, and concluding with an examination of whether the brain and the universe are computers.

A computer can come to understand natural language the same way Helen Keller did: by using “syntactic semantics”—a theory of how syntax can suffice for semantics, i.e., how semantics for natural language can be provided by means of computational symbol manipulation. This essay considers real-life approximations of Chinese Rooms, focusing on Helen Keller’s experiences growing up deaf and blind, locked in a sort of Chinese Room yet learning how to communicate with the outside world. Using the SNePS computational knowledge-representation system, (...) the essay analyzes Keller’s belief that learning that “everything has a name” was the key to her success, enabling her to “partition” her mental concepts into mental representations of: words, objects, and the naming relations between them. It next looks at Herbert Terrace’s theory of naming, which is akin to Keller’s, and which only humans are supposed to be capable of. The essay suggests that computers at least, and perhaps non-human primates, are also capable of this kind of naming. (shrink)

Machine awareness is a disputed research topic, in some circles considered a crucial step in realising Artificial General Intelligence. Understanding what that is, under which conditions such feature could arise and how it can be controlled is still a matter of speculation. A more concrete object of theoretical analysis is algorithmic iteration for computational intelligence, intended as the theoretical and practical ability of algorithms to design other algorithms for actions aimed at solving well-specified tasks. We know this ability is already (...) shown by current AIs, and understanding its limits is an essential step in qualifying claims about machine awareness and Super-AI. We propose a formal translation of algorithmic iteration in a fragment of modal logic, formulate principles of transparency and faithfulness across human and machine intelligence, and consider the relevance to theoretical research on -AI as well as the practical import of our results. (shrink)

I use Carl Gillett’s much heralded dimensioned theory of realization as a platform to develop a plausible part–whole theory. I begin with some basic desiderata for a theory of realization that its key terms should be defined and that it should be explanatory. I then argue that Gillett’s original theory violates these conditions because its explanatory force rests upon an unspecified “in virtue of” relation. I then examine Gillett’s later version that appeals instead to theoretical terms tied to “mechanisms.” Yet (...) I argue that it too violates the desiderata, since it defines realization for mechanisms in terms of two undefined ideas whose explanatory credentials have not been established—“implementation” and “grounds.” Thus I drop those ideas in favor of an explicit constraint that the parts and properties provide a mechanistic explanation. I also distinguish a special mechanistic theory from a preferred general theory that incorporates other kinds of part–whole explanations that target causal powers or capacities. The result is a theory that has the explanatory virtues of mechanistic theories as well as a broader scope desired by Gillett. I also compare the result to a similar idea from Robert Cummins that has been neglected in recent discussions of realization, namely, his general property analysis rather than his functional analysis. Finally, I defend the preferred general theory against possible objections that attempt to show a conflict between metaphysical demands on a theory of realization versus facts about good scientific explanation. (shrink)

The original proof of the four-color theorem by Appel and Haken sparked a controversy when Tymoczko used it to argue that the justification provided by unsurveyable proofs carried out by computers cannot be a priori. It also created a lingering impression to the effect that such proofs depend heavily for their soundness on large amounts of computation-intensive custom-built software. Contra Tymoczko, we argue that the justification provided by certain computerized mathematical proofs is not fundamentally different from that provided by surveyable (...) proofs, and can be sensibly regarded as a priori. We also show that the aforementioned impression is mistaken because it fails to distinguish between proof search (the context of discovery) and proof checking (the context of justification). By using mechanized proof assistants capable of producing certificates that can be independently checked, it is possible to carry out complex proofs without the need to trust arbitrary custom-written code. We only need to trust one fixed, small, and simple piece of software: the proof checker. This is not only possible in principle, but is in fact becoming a viable methodology for performing complicated mathematical reasoning. This is evinced by a new proof of the four-color theorem that appeared in 2005, and which was developed and checked in its entirety by a mechanical proof system. (shrink)