Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- John-Michael M. Kuczynski (2006). Formal Operations and Simulated Thought. Philosophical Explorations 9 (2):221-234.For reasons internal to the concepts of thought and causality, a series of representations must be semantics-driven if that series is to add up to a single, unified thought. Where semantics is not operative, there is at most a series of disjoint representations that add up to nothing true or false, and therefore do not constitute a thought at all. There is necessarily a gulf between simulating thought, on the one hand, and actually thinking, on the other. It doesn't matter how perfect the simulation is; nor does it matter how reliable the causal mechanism involved is. Where semantics is inert, there is no thought. In connection with this, this paper also argues that a popular doctrine - the so-called 'computational theory of mind' (CTM) - is based on a confusion. CTM is the view that thought-processes consist in 'computations', where a computation is defined as a 'form-driven' operation on symbols. The expression 'form-driven operation' is ambiguous, and may refer either to syntax-driven operations or to morphology-driven operations. Syntax-driven operations presuppose the existence of operations that are driven by semantic and extra-semantic knowledge. So CTM is false if the terms 'computation' and 'form-driven operation' are taken to refer to syntax-driven operations. So if CTM is to work, those expressions must be taken to refer to morphology-driven operations. But, as previously stated, an operation must be semantics-driven if it is to qualify as a thought. Thus CTM fails on every disambiguation of the expressions 'formal operation' and 'computation'.
Similar books and articles
This book is concerned with the relationship between semantics and surface structure and in particular with the way in which each is mapped into the other. Jim Miller argues that semantic and syntactic structure require different representations and that semantic structure is far more complex than many analysts realise. He argues further that semantic structure should be based on notions of location and movement. The need for a semantic component of greater complexity is demonstrated by an examination of prepositions, particles, adverbs and verb-prefixes, and is shown to accord with cross-language and historical facts. The volume goes on to consider the sort of rules that are required to map semantic structures onto syntax. Semantics and Syntax tackles fundamental issues and draws together many of the key concepts of traditional grammar and formal linguistics. The general framework for handling syntax, semantics and morphology that it outlines is perhaps a controversial one, but it will be recognized as challenging and original.
John Searle once said: "The Chinese room shows what we knew all along: syntax by itself is not sufficient for semantics. (Does anyone actually deny this point, I mean straight out? Is anyone actually willing to say, straight out, that they think that syntax, in the sense of formal symbols, is really the same as semantic content, in the sense of meanings, thought contents, understanding, etc.?)." I say: "Yes". Stuart C. Shapiro has said: "Does that make any sense? Yes: Everything makes sense. The question is: What sense does it make?" This essay explores what sense it makes to say that syntax by itself is sufficient for semantics.
Sacks [2] has asked whether there exists a uniform solution to Post's problem, i.e. an enumeration operation W such that $\mathbf{d} for every degree d. It is shown here that if such an operation W exists it cannot itself in a particular technical sense be uniform. In fact, the jump operation is characterized amongst such uniform enumeration operations by the condition: $\mathbf{d} for all d. In addition, it is proved that the only other uniform enumeration operations such that d ≤ W (d) for all d are those which equal the identity operation above some fixed degrees.
According to the Computational/Representational Theory of Thought (CRTT ? Language of Thought Hypothesis, or LOTH), propositional attitudes, such as belief, desire, and the like, are triadic relations among subjects, propositions, and internal mental representations. These representations form a representational _system_ physically realized in the brain of sufficiently sophisticated cognitive organisms. Further, this system of representations has a combinatorial syntax and semantics, but the processes that operate on the representations are causally sensitive only to their syntax, not to their semantics. On this approach, a first pass account of propositional attitudes is the following (cf. Field 1978: 37 and Fodor 1987: 17).
Formal semantics is an approach to SEMANTICS1, the study of meaning, with roots in logic, the philosophy of language, and linguistics, and since the 1980’s a core area of linguistic theory. Characteristics of formal semantics to be treated in this article include the following: Formal semanticists treat meaning as mind-independent (though abstract), contrasting with the view of meanings as concepts “in the head” (see I-LANGUAGE AND E-LANGUAGE and MEANING EXTERNALISM AND INTERNALISM); formal semanticists distinguish semantics from knowledge of semantics (Lewis 1975, Cresswell 1978), which has consequences for the notion of semantic COMPETENCE. A central part of the meaning of a sentence on this approach is its TRUTH CONDITIONS, and most although not all formal semantics is model-theoretic, relating linguistic expressions to model-theoretically constructed semantic values cast in terms of truth, REFERENCE, and possible worlds. This sets formal semantics apart from approaches which view semantics as relating a sentence just to a representation on another linguistic “level” (LOGICAL FORM) or a representation in an innate LANGUAGE OF THOUGHT. The formal semanticist could accept such representations as an aspect of semantics but would insist on asking what the model-theoretic semantic interpretation of the given representationlanguage is (Lewis 1970). Formal semantics is centrally concerned with COMPOSITIONALITY at the SYNTAX-SEMANTICS INTERFACE, how the meanings of larger constituents are built up from the meanings of their parts on the basis of their syntactic structure, and with the relation between compositional SENTENCE MEANING and meaning in discourse.
Roger Schank's research in AI takes seriously the ideas that understanding natural language involves mapping its expressions into an internal representation scheme and that these internal representations have a syntax appropriate for computational operations. It therefore falls within the computational approach to the study of mind. This paper discusses certain aspects of Schank's approach in order to assess its potential adequacy as a (partial) model of cognition. This version of the Language of Thought hypothesis encounters some of the same difficulties that arise for Fodor's account.
In the recent literature of the philosophy of science, much space has been given to the problem of analyzing theories of the deductive and natural sciences in a way which makes explicit some of the syntactic and semantic features which seem to be implicitly present in their structures. This pa- per is concerned with the same problem; however, some other problems of syntax and semantics are touched upon along the way. After some prelim- inaries, a very general method of constructing symbolic languages is intro- duced. The resulting languages are interpreted in either empty or non- empty sets and so in a way which permits them to contain terms which stand for nothing at all and an existence predicate which is not applicable to all terms. Also, certain variable binders are interpreted in a way which leaves open the possibility of interpreting them modally and a semantic operation of degree of truth for arbitrary formulas is introduced. An axiomless logic commensurate with a semantics of this kind and so one which contains a new treatment of definite descriptions is then constructed and shown to be both sound and semantically complete. Finally, theories and various concepts pertaining to theories are defined on the basis of this syntax and semantics. Among the concepts are operations which assign degrees of confirmation, explanatory powers, degrees of deductive simplic- ity, and degrees of adequacy to theories, relations and concreteness and abstractness for expressions, a relation of significance for theories, and operations which assign denotations and meanings to expressions.
There is a thesis often aired by some philosophers of psychology that syntax is all we need and there is no need to advert to intentional/semantic properties of symbols for purposes of psychological explanation. Indeed, the worry has been present since the first explicit articulation of so-called Computational Theory of Mind (CTM). Even Fodor, who has been the most ardent defender of the Language of Thought Hypoth- esis (LOTH) (which requires the CTM), has raised worries about its apparent consequences. The worry can be put in the form of a question, which Fodor called the.
The Language of Thought Hypothesis (LOTH) is an empirical thesis about thought and thinking. For their explication, it postulates a physically realized system of representations that have a combinatorial syntax (and semantics) such that operations on representations are causally sensitive only to the syntactic properties of representations. According to LOTH, thought is, roughly, the tokening of a representation that has a syntactic (constituent) structure with an appropriate semantics. Thinking thus consists in syntactic operations defined over representations. Most of the arguments for LOTH derive their strength from their ability to explain certain empirical phenomena like productivity, systematicity of thought and thinking.
According to the computational theory of mind (CTM), to think is to compute. But what is meant by the word 'compute'? The generally given answer is this: Every case of computing is a case of manipulating symbols, but not vice versa - a manipulation of symbols must be driven exclusively by the formal properties of those symbols if it is qualify as a computation. In this paper, I will present the following argument. Words like 'form' and 'formal' are ambiguous, as they can refer to form in either the syntactic or the morphological sense. CTM fails on each disambiguation, and the arguments for CTM immediately cease to be compelling once we register that ambiguity. The terms 'mechanical' and 'automatic' are comparably ambiguous. Once these ambiguities are exposed, it turns out that there is no possibility of mechanizing thought, even if we confine ourselves to domains (such as first-order sentential logic) where all problems can be settled through decision-procedures. The impossibility of mechanizing thought thus has nothing to do with recherché mathematical theorems, such as those proven by Gödel and Rosser. A related point is that CTM involves, and is guilty of reinforcing, a misunderstanding of the concept of an algorithm.
Discussion of John-Michael M. Kuczynski, Formal operations and simulated thought
|
|
There are no threads in this forum |
Nothing in this forum yet.

