A. Newell, "Physical Symbol Systems", Cognitive Science, 4 (1980) 135-183.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....but now seen to be a failure. Moreover, protocol analysis is based on a simplistic cognitivist model of human thinking as essentially computational, involving abstract representations of concepts, and their transformation by algorithms that are precisely speci ed by computer programs (e.g. see [31]) Finally, even if it were possible to get a trace of a speaker s autonomous cognitive activity, such an object would be inappropriate for the requirements process, because the client does not have any pre existing mental model of the desired system. Rather, the client has knowledge about ....

Allen Newell. Physical symbol systems. Cognitive Science, 4:135-183, 1980. 13

....however, as I have prepared this paper, it has served as the background against which .I have critically examined both connectionist and more traditional AI paradigms. 2 Connectionist and Heuristic Search Models For most of its history, the heuristic search, logic, and physical symbol system [19] paradigms have doxninated AI. AI was conceived at about the same time that protocol analysis was in vogue in psychology [16t; such protocols could be implemented on the then new yon Neumann machines fairly well. Protocol analysis suggested that people operate by trial and error, using word like ....

Newell, A. "Physical Symbol Systems," Cognitive Science 4 (4), 135-183, 1980.

.... law is a simple form of rationality that an agent will operate in its own best interest according to what it knows [43] The empirical hypothesis put forward in this approach is that general intelligence can only be displayed by systems that can manipulate symbols: i.e. physical symbol systems [48, 41]. This view has been criticized on several grounds and a number of fundamental problems have been identified; the frame problem [36] the symbol grounding problem [63, 21] the frame of reference problem [11] and the problem of situatedness [65] see [51] for a review) It has been argued that ....

....intelligent systems must be described. The knowledge level, in turn, is implemented by the symbol, or program, level which is implemented at the hardware level. Where the knowledge level describes the competence of an intelligent system; the architecture is the instantiated physical symbol system [48, 41]. This physical symbol system should approximate the competences defined by its knowledge level specification. Hence, the knowledge level specifies the functional properties of the actually physically instantiated intelligent system in terms of knowledge, goals, and actions. On one hand the ....

[Article contains additional citation context not shown here]

A. Newell. Physical symbol systems. Cognitive Science, 4:135-183, 1980.

....is the law of rationality: a rational system will use its knowledge in order to reach its goals. A paradigmatic example of this approach, which constituted the core of the artificial intelligence program, is the hypothesis of Physical Symbol Systems (PSS) put forward by Newell and Simon [Newell, 1980]. The states of the environment, in which a PSS is embedded, are transduced to internal symbolic representations. A PSS is able to perform operations on these representations, the result of which are again symbolic expressions. The output of the system is defined through the interpretation of ....

Newell, A. (1980). Physical symbol systems. Cognitive Science, 4:135--183.

....machines. They are not, of course, committed to the details of these machines as exemplified in Turing s original formulation or in typical commercial computers; only to the basic idea that the kind of computing that is relevant to understanding cognition involves operations on symbols (see Newell, 1980, 1982; Fodor 1976, 1987; or Pylyshyn, 1980, 1984) In contrast, Connectionists propose to design systems that can exhibit intelligent behavior without storing, retrieving, or otherwise operating on structured symbolic expressions. The style of processing carried out in such models is thus ....

....Connectionism and Cognitive Architecture structural relations among physical properties of the brain. For example, the relation part of , which holds between a relatively simple symbol and a more complex one, is assumed to 10 correspond to some physical relation among brain states. This is why Newell (1980) speaks of computational systems such as brains and Classical computers as physical symbols systems . This bears emphasis because the Classical theory is committed not only to there being a system of physically instantiated symbols, but also to the claim that the physical properties onto which ....

Newell, A.(1980). Physical symbol systems. Cognitive Science, 4, 135-183.

....machines. Turing s typically bold assertions led the way for other thinkers to develop (often in equally assertive fashion) computationalism the hypothesis that cognition is the computation of functions (Dietrich 1990, p. 135) Influential work in this tradition, post Turing, includes Newell (1980), Pylyshyn (1984) Pagels (1988) and Dietrich (1990) Only relatively rarely has this foundational assumption been questioned by, e.g. Searle (1980, 1990) Johnson Laird (1983) Rubel (1985) McGinn (1989) and Penrose (1989) Some workers in symbolic AI have championed analogical reasoning as a ....

Newell, A. (1980). Physical symbol systems. Cognitive Science 4, 135--183.

....Hypotheses Newell (1982) proposed the KL hypothesis in an attempt to clarify the role played in AI by the key notions of knowledge and representation. His solution was based on a functional view of intelligent systems (Newell and Simon, 1972) coupled with the physical symbol system hypothesis (Newell, 1980). This consisted in the introduction of a new level of analysis for intelligent systems, resting above the symbol or representation level, and where knowledge was to be defined. Functional decomposition of physical symbol systems. Newell and Simon (1972) proposed a theory to explain (general) ....

Newell, A.(1980). Physical symbol systems, Cognitive Science 4(2) 135--183.

....possibly the most easily questioned assumption of arguments fielded by leading advocates of AI. Newell, for example, appeals to the Church Turing thesis improperly so called in the course of his famous argument for the crucial sufficiency part of his and Simon s physical symbol system hypothesis (Newell 1980). A physical symbol system is a universal Turing machine, or any equivalent system, situated in the physical as opposed to the conceptual world (1980: 147 50, 154 55, 161) The tape of the universal machine is finite: Newell requires that the storage capacity of the machine be unlimited in ....

Newell, A. 1980. 'Physical Symbol Systems'. Cognitive Science, 4, pp.135-183.

....so called Church Turing thesis (aka Church s thesis ) i) A]nything computable is Turing machine computable. Dennett 1978: 83. ii) That there exists a most general formulation of machine and that it leads to a unique set of input output functions has come to be called Church s thesis. (Newell 1980: 150. iii) S]ince all computers operate entirely on algorithms, the . limits of Turing machines . also describe the theoretical limits of all computers (McArthur 1991: 401) 5 (iv) Turing s analysis of what is involved in computation . seems so general that it is hard to imagine ....

Newell, A. 1980. 'Physical Symbol Systems'. Cognitive Science, 4, 135-183.

.... properties of intelligent systems like, for example, being massively parallel, context sensitive, adaptable and robust (see e.g. 7] It is strongly believed that intelligent systems must also be able to represent and reason about structured objects and structure sensitive processes (see e.g. [8, 23]) Unfortunately, we are unaware of any connectionist system which can handle structured objects and structure sensitive processes in a satisfying way. Logic systems were designed to cope with such objects and processes and, consequently, it is a long standing research goal to combine the ....

A. Newell. Physical symbol systems. Cognitive Science, 4:135-183, 1980.

....mapping does or that only certain classes do 20 in a sense, the more restricted the class is, the more useful the concept of symbol. By the same token, we take no comfort at all from the observation that any computable function can be implemented on what Newell calls a physical symbol system [63]. We take it for granted that the mappings could be implemented on a general purpose digital computer or on analogue hardware. The real issue is whether symbols would help us in (i) identifying and (ii) describing the mappings in seeing inside the black box (or Chinese Room [5] How would we ....

A. Newell,"Physical Symbol Systems",Cognitive Science, 4, pp.135-183, 1980.

.... properties of intelligent systems like, for example, being massively parallel, context sensitive, adaptable and robust (see e.g. 10] It is strongly believed that intelligent systems must also be able to represent and reason about structured objects and structure sensitive processes (see e.g. [12, 25]) Unfortunately, we are unaware of any connectionist system which can handle structured objects and structure sensitive processes in a satisfying way. Logic systems were designed to cope with such objects and processes and, consequently, it is a long standing research goal to combine the ....

A. Newell. Physical symbol systems. Cognitive Science, 4:135-183, 1980.

....Aristotle invented the syllogism, it has been known that a representation s syntax can encode its role in inference. What is different today is that we have computers capable of automating this process. This has strengthened the view that the mind like language is a kind of symbol system [26]. The traditional AI approach to constructing a symbol system involves a programmer determining a set elementary symbols and rules for combining and manipulating them [19, 30] The symbols may be manipulated deductively [20] or procedurally [6] In the lat segment regions no regions scale (64 ....

Newell, A. (1980). Physical symbol systems. Cognitive Science, 4, 135-183.

....applicability, even though the highest ranked valid move is always applied. This way evolution results in neural networks with human like reasoning behavior. 1 Introduction Many of the successes in theorem proving have been achieved through symbolic systems (Boyer and Moore 1975; Anderson 1983; Newell 1980b) Most of these symbolic theorem provers depend on some decision procedure particular to the logic on which they operate. They must restrict the logic to a decidable subset of first order logic, such as propositional logic or Horn logic. Others, like the well known resolution method (Robinson ....

Newell, A. (1980b). Physical symbol systems. Cognitive Science, 4:135--183.

....(including the human mind) is that of the symbol. The symbol is an entity in a computational system that can have arbitrary designations and is used to refer to an entity in the outside world, and the main assumptions on which this paradigm rests were coherently outlined by Newell and Simon (Newell Simon, 1980) under the Physical Symbol System Hypothesis (PSSH) The PSSH states that an entity (or computational system) is intelligent by virtue of the fact that it instantiates a physical symbol system, i.e. a physical system that is engaged in the manipulation of symbols. Symbols are usually taken to ....

NEWELL, A. (1980) Physical symbol systems. Cognitive Science, 4, 135-183.

....systems. The behaviour of both of these systems can be described by formulating a set of general principles, i.e. rules, but the representations and processes used by these two systems are fundamentally different. The two systems we will contrast and debate will be a Physical Symbol System (Newell, 1980), hereafter referred to as a PSS, and a system based on the use of non symbolic representations and processes sensitive to spatial structure, hereafter refered to as a Non Symbolic System (NSS) The task selected for the two systems is to classify simple tree structures (Figure 5) according to ....

Newell, A. (1980). Physical symbol systems. Cognitive Science, (4):135--183.

....is the law of rationality: a rational system will use its knowledge in order to reach its goals. A paradigmatic example of this approach, which constituted the core of the artificial intelligence program, is the hypothesis of Physical Symbol Systems (PSS) put forward by Newell and Simon [Newell, 1980]. Despite its limitations 20 the proposed model of the reflective controller, DACIII, is the closest approximation of a synthetic rational system, which uses its knowledge to reach its goals. The goals are defined in terms of its internal states, i.e. avoid or approach. In case the IS population ....

Newell, A. (1980). Physical symbol systems. Cognitive Science, 4:135--183.

No context found.

A. Newell, "Physical Symbol Systems", Cognitive Science, 4 (1980) 135-183.

No context found.

Newell, A. (1980). Physical Symbol Systems. Cognitive Science, 4, 135-183.

No context found.

Newell, A. (1980). Physical symbol systems. Cognitive Science, 135-183. New York: McGraw-Hill.

No context found.

A. Newell. Physical symbol systems. Cognitive Science, 4:135--183, 1980.

No context found.

Newell, A. (1980). Physical symbol systems. Cognitive Science, 4, 135--183.

No context found.

A. Newell. Physical symbol systems. Cognitive Science, 4:135--183, 1980.

No context found.

Allen Newell. Physical symbol systems. Cognitive Science, 4:135--183, 1980.

No context found.

A. Newell. Physical symbol systems. Cognitive Science, 4:135--183, 1980. 161

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC