Susan G. Sterrett

On a literal reading of `Computing Machinery and Intelligence'', Alan Turing presented not one, but two, practical tests to replace the question `Can machines think?'' He presented them as equivalent. I show here that the first test described in that much-discussed paper is in fact not equivalent to the second one, which has since become known as `the Turing Test''. The two tests can yield different results; it is the first, neglected test that provides the more appropriate indication of intelligence. This is because the features of intelligence upon which it relies are resourcefulness and a critical attitude to one''s habitual responses; thus the test''s applicablity is not restricted to any particular species, nor does it presume any particular capacities. This is more appropriate because the question under consideration is what would count as machine intelligence. The first test realizes a possibility that philosophers have overlooked: a test that uses a human''s linguistic performance in setting an empirical test of intelligence, but does not make behavioral similarity to that performance the criterion of intelligence. Consequently, the first test is immune to many of the philosophical criticisms on the basis of which the (so-called) `Turing Test'' has been dismissed.

Experimental engineering models have been used both to model general phenomena, such as the onset of turbulence in fluid flow, and to predict the performance of machines of particular size and configuration in particular contexts. Various sorts of knowledge are involved in the method - logical consistency, general scientific principles, laws of specific sciences, and experience. I critically examine three different accounts of the foundations of the method of experimental engineering models (scale models), and examine how theory, practice, and experience are involved in employing the method to obtain practical results. Models of machines and mechanisms can be (and generally are) involved in establishing criteria for similar phenomena, which provide guidance in using events to model other events. Conversely, models of phenomena such as events that model other events can be (and generally are) involved in experimentation on models of machines. I conclude that often it is not more detailed models or the more precise equations they engender that leads to better understanding, but rather an insightful use of knowledge at hand to determine which similarity principles are appropriate in allowing us to infer what we do not know from what we are able to observe.

Turing wrote that the “guiding principle” of his investigation into the possibility of intelligent machinery was “The analogy [of machinery that might be made to show intelligent behavior] with the human brain.” [10] In his discussion of the investigations that Turing said were guided by this analogy, however, he employs a more far-reaching analogy: he eventually expands the analogy from the human brain out to “the human community as a whole.” Along the way, he takes note of an obvious fact in the bigger scheme of things regarding human intelligence: grownups were once children; this leads him to imagine what a machine analogue of childhood might be. In this paper, I’ll discuss Turing’s child-machine, what he said about different ways of educating it, and what impact the “bringing up” of a child-machine has on its ability to behave in ways that might be taken for intelligent. I’ll also discuss how some of the various games he suggested humans might play with machines are related to this approach.

Today I want to talk about an element in the milieu in which Ludwig Wittgenstein conceived the Tractatus Logico-Philosophicus that has not been recognized to date: the generalization of the methodology of experimental scale models that occurred just about the time he was writing it. I find it very helpful to keep in mind how this kind of model portrays when reading the Tractatus — in particular, when reading the statements about pictures and models, such as:That a picture is a fact ,That a picture is a model of reality ,That the “pictorial relationship” that makes a picture a picture is part of that picture , andThat a picture must have its pictorial form in common with reality in order to able to depict it

I argue here that Frege’s eventual view on the relation between sentences and the thoughts they express is that, ideally, a sentence expresses exactly one thought, and a thought is expressed by exactly one (canonical) sentence. This may clash with some mainstream views of Frege, for it has the consequence of de-emphasizing the philosophical significance of the question of how it is possible for someone to regard one sentence as true yet regard another sentence that expresses the same thought as false. This account of Frege was developed by taking a long-range look at his writings over the course of his life.

Demonstrating the different roles that logic plays in the disciplines of computer science, mathematics, and philosophy, this concise undergraduate textbook covers select topics from three different areas of logic: proof theory, computability theory, and nonclassical logic. The book balances accessibility, breadth, and rigor, and is designed so that its materials will fit into a single semester. Its distinctive presentation of traditional logic material will enhance readers' capabilities and mathematical maturity. The proof theory portion presents classical propositional logic and first-order logic using a computer-oriented (resolution) formal system. Linear resolution and its connection to the programming language Prolog are also treated. The computability component offers a machine model and mathematical model for computation, proves the equivalence of the two approaches, and includes famous decision problems unsolvable by an algorithm. The section on nonclassical logic discusses the shortcomings of classical logic in its treatment of implication and an alternate approach that improves upon it: Anderson and Belnap's relevance logic. Applications are included in each section. The material on a four-valued semantics for relevance logic is presented in textbook form for the first time. Aimed at upper-level undergraduates of moderate analytical background, Three Views of Logic will be useful in a variety of classroom settings. Gives an exceptionally broad view of logic. Treats traditional logic in a modern format. Presents relevance logic with applications. Provides an ideal text for a variety of one-semester upper-level undergraduate courses

In "The Status and Future of the Turing Test" (Moor, 2001), which appeared in an earlier issue of this journal, James Moor remarks on my paper "Turing's Two Tests for Intelligence." In my paper I had claimed that, whatever Turing may or may not have thought, the test described in the opening section of Turing's now legendary 1950 paper "Computing Machinery and Intelligence" is not equivalent to, and in fact is superior to, the test described in a passage that occurs much later in Turing's paper (i.e., in Section 5 of Turing, 1950). I'm pleased Moor chose to give such prominence to my point, and very happy to see that he recognized that my claim was a normative one about the superiority of one test over another, rather than a claim about Turing's intentions. However, as I think the way he describes my point could lead to misunderstandings, I'd like to clarify the points I made. One major clari?cation is which two tests I am contrasting; another is that the difference in overall structure of the two tests is of philosophical signi?cance