William J. Rapaport

For a formal language, one usually only considers semantic interpretations which are complete: for each singular referring expression in the language, there corresponds an element of the universe of discourse. However, natural languages only have a partial interpretation function when given such a set- or model-theoretic semantics whose universe of discourse (or "model") is taken to be the real, physical world. To put semantics on a par with syntax for parity of treatment of natural and formal languages, two alternatives suggest themselves. (1) The syntax of a natural language can be changed so that the interpretation function becomes total. What I urge, on the other hand, is (2) that we change the semantics of natural language, as outlined earlier, by enlarging the range of the interpretation function to make it total. I suggest making the world fit our language by adding Meinongian objects to it.

_A unique resource exploring the nature of computers and computing, and their relationships to the world._ _Philosophy of Computer Science_ is a university-level textbook designed to guide readers through an array of topics at the intersection of philosophy and computer science. Accessible to students from either discipline, or complete beginners to both, the text brings readers up to speed on a conversation about these issues, so that they can read the literature for themselves, form their own reasoned opinions, and become part of the conversation by contributing their own views. Written by a highly qualified author in the field, the book looks at some of the central questions in the philosophy of computer science, including: What is philosophy? (for readers who might be unfamiliar with it) What is computer science and its relationship to science and to engineering? What are computers, computing, algorithms, and programs?(Includes a line-by-line reading of portions of Turing’s classic 1936 paper that introduced Turing Machines, as well as discussion of the Church-Turing Computability Thesis and hypercomputation challenges to it) How do computers and computation relate to the physical world? What is artificial intelligence, and should we build AIs? Should we trust decisions made by computers? A companion website contains annotated suggestions for further reading and an instructor’s manual. _Philosophy of Computer Science_ is a must-have for philosophy students, computer scientists, and general readers who want to think philosophically about computer science.

Deliberate contextual vocabulary acquisition (CVA) is a reader’s ability to figure out a meaning for an unknown word from its “context.” without external sources of help. The appropriate context for such CVA is the “belief-revised integration” of the reader’s prior knowledge with the reader’s “internalization” of the text. We present and defend a computational theory of CVA that we have adapted to a new classroom curriculum designed to help students use CVA to improve their reading comprehension.

I advocate a theory of “syntactic semantics” as a way of understanding how computers can think (and how the Chinese-Room-Argument objection to the Turing Test can be overcome): (1) Semantics, considered as the study of relations between symbols and meanings, can be turned into syntax – a study of relations among symbols (including meanings) – and hence syntax (i.e., symbol manipulation) can suffice for the semantical enterprise (contra Searle). (2) Semantics, considered as the process of understanding one domain (by modeling it) in terms of another, can be viewed recursively: The base case of semantic understanding –understanding a domain in terms of itself – is “syntactic understanding.” (3) An internal (or “narrow”), first-person point of view makes an external (or “wide”), third-person point of view otiose for purposes of understanding cognition.

I survey a common theme that pervades the philosophy of computer science (and philosophy more generally): the relation of computing to the world. Are algorithms merely certain procedures entirely characterizable in an “indigenous,” “internal,’ “intrinsic,” “local,” “narrow,” “syntactic” (more generally: “intra-system”), purely-Turing-machine language? Or must algorithms interact with the real world, having a purpose that is expressible only in a language with an “external,” “extrinsic,” “global,” “wide,” “inherited” (more generally: “extra” or “inter-“system) semantics?

In their Why Machines Will Never Rule the World, Landgrebe and Smith (2023) argue that it is impossible for artificial general intelligence (AGI) to succeed, on the grounds that it is impossible to perfectly model or emulate the “complex” “human neurocognitive system”. However, they do not show that it is logically impossible; they only show that it is practically impossible using current mathematical techniques. Nor do they prove that there could not be any other kinds of theories than those in current use. Even if perfect theories were impossible or unlikely, perfection may not be needed and may even be unhelpful.

Philosophy has been characterized (e.g., by Benson Mates) as a field whose problems are unsolvable. This has often been taken to mean that there can be no progress in philosophy as there is in mathematics or science. The nature of problems and solutions is considered, and it is argued that solutions are always parts of theories, hence that acceptance of a solution requires commitment to a theory (as suggested by William Perry's scheme of cognitive development). Progress can be had in philosophy in the same way as in mathematics and science by knowing what commitments are needed for solutions. Similar views of Rescher and Castañeda are discussed.

Hauser argues that his pocket calculator (Cal) has certain arithmetical abilities: it seems Cal calculates. That calculating is thinking seems equally untendentious. Yet these two claims together provide premises for a seemingly valid syllogism whose conclusion - Cal thinks - most would deny. He considers several ways to avoid this conclusion, and finds them mostly wanting. Either we ourselves can't be said to think or calculate if our calculation-like performances are judged by the standards proposed to rule out Cal; or the standards- e.g., autonomy and self-consciousness- make it impossible to verify whether anything or anyone (save oneself) meets them. While appeals to the intentionality of thought or the unity of minds provide more credible lines of resistance, available accounts of intentionality and mental unity are insufficiently clear and warranted to provide very substantial arguments against Cal's title to be called a thinking thing. Indeed, considerations favoring granting that title are more formidable than is generally appreciated. Rapaport's comments suggest that, on a strong view of thinking, mere calculating is not thinking (and pocket calculators don't think), but on a weak, but unexciting, sense of thinking, pocket calculators do think. He closes with some observations on the implications of this conclusion.

Deliberate contextual vocabulary acquisition (CVA) is a reader’s ability to figure out a (not the) meaning for an unknown word from its “context”, without external sources of help such as dictionaries or people. The appropriate context for such CVA is the “belief-revised integration” of the reader’s prior knowledge with the reader’s “internalization” of the text. We discuss unwarranted assumptions behind some classic objections to CVA, and present and defend a computational theory of CVA that we have adapted to a new classroom curriculum designed to help students use CVA to improve their reading comprehension.

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.

Everyone has a different "learning style". (A good introduction to the topic of learning styles is Claxton & Murrell 1987. For more on different learning styles, see Keirsey Temperament and Character Web Site, William Perry's Scheme of Intellectual and Ethical Development, Holland 1966, Kolb 1984, Sternberg 1999. For an interesting discussion of some limitations of learning styles from the perspective of teaching styles, see Glenn 2009/2010.) For some online tools targeted at different learning styles, see "100 Helpful Web Tools for Every Kind of Learner".

We discuss a research project that develops and applies algorithms for computational contextual vocabulary acquisition (CVA): learning the meaning of unknown words from context. We try to unify a disparate literature on the topic of CVA from psychology, first- and secondlanguage acquisition, and reading science, in order to help develop these algorithms: We use the knowledge gained from the computational CVA system to build an educational curriculum for enhancing students’ abilities to use CVA strategies in their reading of science texts at the middle-school and college undergraduate levels. The knowledge gained from case studies of students using our CVA techniques feeds back into further development of our computational theory. Keywords: artificial intelligence, knowledge representation, reading, reasoning, science education, vocabulary acquisition.