Main.LevelsOfDescription History

Hide minor edits - Show changes to output

May 12, 2007, at 04:36 AM by 219.77.142.103 -
Changed lines 3-4 from:
* [Required] Excerpt from David Marr (1982) ''Vision'' Freeman Publishers (see below). From chapter 28 of Anderson, James A., Rosenfeld, Edward, Pellionisz, Andras (1988). ''Neurocomputing. Foundations of Research'' Cambridge, Mass: MIT Press. [accessible from netlibrary.com]
to:
* [Required] Excerpt from cite:marr82 David Marr (1982) ''Vision'' Freeman Publishers (see below). From chapter 28 of Anderson, James A., Rosenfeld, Edward, Pellionisz, Andras (1988). ''Neurocomputing. Foundations of Research'' Cambridge, Mass: MIT Press. [accessible from netlibrary.com]
Changed lines 3-4 from:
* [Required] Extract (see below) from chapter 28 (excerpt from Marr) of Anderson, James A.; Rosenfeld, Edward.; Pellionisz, Andras (1988) Neurocomputing. Foundations of Research Cambridge, Mass. MIT Press. [accessible from netlibrary.com]
to:
* [Required] Excerpt from David Marr (1982) ''Vision'' Freeman Publishers (see below). From chapter 28 of Anderson, James A., Rosenfeld, Edward, Pellionisz, Andras (1988). ''Neurocomputing. Foundations of Research'' Cambridge, Mass: MIT Press. [accessible from netlibrary.com]
Changed lines 9-15 from:
!Extract from Marr (1982)

p470.
!!!Extract from Marr(1982)

Marr (1982) ''Vision'' Freeman Publishers.

to:
!From Marr (1982, p.470)
Changed lines 32-33 from:
media:multiplication-table.jpg
to:

Changed lines 37-40 from:
||Computational level||Multiplication||
||Algorithm / representation level||base 10 vs binary, table lookup vs. addition||
||Hardware implementation level||electronic vs. mechanical
||
to:
||Computational level||Multiplication 9x8=?||
||Algorithm / representation level|| media:multiplication-table.jpg vs. 9+9+9+9+9+9+9+9=||
||Hardware implementation level||mechanical
vs. electronic||
Changed lines 32-33 from:
to:
media:multiplication-table.jpg
September 03, 2005, at 12:26 PM by 219.77.133.242 -
Changed lines 33-38 from:
Consider a calculation machine and various possible implementations:

Computational level Multiplication
Algorithm / representation
level base 10 vs binary, table lookup vs. addition
Hardware implementation level electronic
vs. mechanical
to:
Consider a calculation machine and various possible implementations of mutiplication:

||border=1 cellpadding=5 cellspacing=0
||Computational
level||Multiplication||
||Algorithm / representation level||base 10
vs binary, table lookup vs. addition||
||Hardware implementation level||electronic vs.
mechanical||
September 03, 2005, at 12:25 PM by 219.77.133.242 -
Changed line 29 from:
media:beaker.jpg
to:
media:beaker.gif
September 03, 2005, at 12:25 PM by 219.77.133.242 -
Changed lines 29-30 from:
to:
media:beaker.jpg
media:abacus.jpg
September 03, 2005, at 12:24 PM by 219.77.133.242 -
Added lines 30-31:
media:calculator.jpg
July 26, 2005, at 10:52 AM by 219.78.20.18 -
Changed lines 37-39 from:
* A computational approach to mental processes would have to appeal to theories at all three levels.
to:
* A computational approach to mental processes would have to appeal to theories at all three levels.

[[Category.Mind]]
July 25, 2005, at 10:55 PM by 219.77.144.13 -
Changed lines 12-23 from:

    Computational theory Representation and algorithm Hardware implementation
    What is
the goal of the computation, why is it appropriate, and what is the logic of the strategy by which it can be carried out? How can this computational theory be implemented? In particular, what is the representation for the input and output, and what is the algorithm for the transformation? How can the representation and algorithm be realized physically?

    Figure 1-4

    The three levels at which any machine carrying out an information-processing task must be understood.

!The Three Levels

    We can summarize our discussion in something like the manner shown in Figure 1-4, which illustrates the different levels at which an information-processing device must be understood before one can be said to have understood it completely. At one extreme
, the top level, is the abstract computational theory of the device, in which the performance of the device is characterized as a mapping from one kind of information to another, the abstract properties of this mapping are defined precisely, and its appropriateness and adequacy for the task at hand are demonstrated. In the center is the choice of representation for the input and output and the algorithm to be used to transfer one into the other. And at the other extreme are the details of how the algorithm and representation are realized physically - the detailed computer architecture, so to speak. These three levels are coupled, but only loosely. The choice of an algorithm is influenced for example, by what it has to do and by the hardware in which it must run. But there is a wide choice available at each level, and the explication of each level involves issues that are rather independent of the other two. 
to:
!!!Extract from Marr(1982)

Marr (1982) ''Vision'' Freeman Publishers.

||border=1 cellpadding=5 cellspacing=0
||Computational theory||Representation and algorithm||Hardware implementation||
||What is the goal of
the computation, why is it appropriate, and what is the logic of the strategy by which it can be carried out? ||How can this computational theory be implemented? In particular, what is the representation for the input and output, and what is the algorithm for the transformation?||How can the representation and algorithm be realized physically?||

Figure 1-4

The three levels at which any machine carrying out an information-processing task must be understood.

The Three Levels

We can summarize our discussion in something like the manner shown in Figure 1-4, which illustrates the different levels at which an information-processing device must be understood before one can be said to have understood it completely. At one extreme, the top level, is the abstract computational theory of the device
, in which the performance of the device is characterized as a mapping from one kind of information to another, the abstract properties of this mapping are defined precisely, and its appropriateness and adequacy for the task at hand are demonstrated. In the center is the choice of representation for the input and output and the algorithm to be used to transfer one into the other. And at the other extreme are the details of how the algorithm and representation are realized physically - the detailed computer architecture, so to speak. These three levels are coupled, but only loosely. The choice of an algorithm is influenced for example, by what it has to do and by the hardware in which it must run. But there is a wide choice available at each level, and the explication of each level involves issues that are rather independent of the other two.
July 25, 2005, at 10:20 PM by 219.77.144.13 -
Added lines 1-33:
!Reading

* [Required] Extract (see below) from chapter 28 (excerpt from Marr) of Anderson, James A.; Rosenfeld, Edward.; Pellionisz, Andras (1988) Neurocomputing. Foundations of Research Cambridge, Mass. MIT Press. [accessible from netlibrary.com]

!Levels of description

* Complex systems have various levels of description, e.g. description at the level of the economy (inflation rate, GDP), description at the level of individuals (personal income and behavior)

!Extract from Marr (1982)

p470.

    Computational theory Representation and algorithm Hardware implementation
    What is the goal of the computation, why is it appropriate, and what is the logic of the strategy by which it can be carried out? How can this computational theory be implemented? In particular, what is the representation for the input and output, and what is the algorithm for the transformation? How can the representation and algorithm be realized physically?

    Figure 1-4

    The three levels at which any machine carrying out an information-processing task must be understood.

!The Three Levels

    We can summarize our discussion in something like the manner shown in Figure 1-4, which illustrates the different levels at which an information-processing device must be understood before one can be said to have understood it completely. At one extreme, the top level, is the abstract computational theory of the device, in which the performance of the device is characterized as a mapping from one kind of information to another, the abstract properties of this mapping are defined precisely, and its appropriateness and adequacy for the task at hand are demonstrated. In the center is the choice of representation for the input and output and the algorithm to be used to transfer one into the other. And at the other extreme are the details of how the algorithm and representation are realized physically - the detailed computer architecture, so to speak. These three levels are coupled, but only loosely. The choice of an algorithm is influenced for example, by what it has to do and by the hardware in which it must run. But there is a wide choice available at each level, and the explication of each level involves issues that are rather independent of the other two.

!Example

Consider a calculation machine and various possible implementations:

Computational level Multiplication
Algorithm / representation level base 10 vs binary, table lookup vs. addition
Hardware implementation level electronic vs. mechanical

* The mind can be analyzed at various levels as well.
* A computational approach to mental processes would have to appeal to theories at all three levels.