Course description:  How does the human mind arise from a physical brain?   How could perception, reasoning, and memory all emerge from unthinking matter?  According to the Computational Theory of Mind, the brain is a biological computer, and cognition is its function.   We'll examine this idea from a philosophical and logical perspective.  Starting with the simplest mechanical parts, we will gradually build up layers of complexity, computational power, and abstraction. By the end of the course, we'll be able to design organisms exhibit fundamental forms of of cognition.  Along the way we'll touch upon the nature of representation, language, memory, algorithms, levels of abstraction, and the interaction between the mind and the environment.   Requirements include: • daily readings; • 6 problem sets; • optional final project; • lecture attendance; • no final exam. Warning: this course is time-intensive!
Announcements
  • HW 6 due date CHANGE
    ​Now Due Friday, March 12, 11:59 pm.
  • HW7 due date
    Thursday, March 18, 11:59 pm.
Sections + Office hours 
  • Zhang sections: F 1-2 / 2-3
  • Greenberg office hours:
    ​Philosophy: T 6-7
    Homework: Th 6-7 
  • Zhang office hours: M 12-2
  • All zoom links on CCLE.
Course book  ​Homework assignments

Syllabus
(T) = Technical text.
(C) = Conceptual text.
* = Classic text.

Unit 1: Computation

1.1 The Cognition-Body Problem
​​T 1/5
​MM 1-2
Read:
1.2 Logic Gates & Combinatorial Circuits
Th 1/7
​MM 3
Read:Of interest:
Reading Guide
The Hillis reading will be essential to understanding the technical concepts we will discuss in class and for HW1: logic gates, logic circuits, and their relationship to computation.

The Edelman reading won't be the main focus of discussion, but it is part of a bigger picture that we will build up each week, about the analogies between the logic-based computers and the neural circuitry of the brain.
2.1 Functions & Representations
​T 1/12
MM 4-5
Read:Useful:
  • (C) Gallistel and King (2009) Memory and the Computational Brain, Ch. 3: "Functions"
Reading Guide
The reading by Petzold introduces the concept of a representational system, in particular, the base-2 binary counting system.   The reading by Redwoods provides important background on the mathematical concept of a function.   Both will be critical to class discussion and HW1.

The Edelman reading is an insightful introduction to the concept of representation, a central idea within CTM.   These concepts  will become more important in the next few weeks as we discuss CTM in greater detail, and will be relevant for the philosophical questions in HW2 and the final project.
HW1.  Basics: Circuits, Functions, and Representations
Due Th 1/14, 4PM PST (before class)
2.2 Computation with Combinatorial Circuits (CCs)
​Th 1/14
Handout: MM 6
Read:
Reading Guide
So far we've studied circuits, functions, and representational systems.  We now combine all three elements to define computation.

Start by focusing on the the reading by Crane​, which is an accessible description to the relationship between functions, algorithms, and computation.  What is the difference between instantiating and computing a function?  What is an automatic algorithm?

The Cummins reading is a classic statement on the concept of computation, with special attention to the role of representation.  This text is difficult and rather abstract, but you will achieve a deeper understanding of the course material if you can tame it.
3.1 The Story of Binary +1 (CC)
​T 1/19
Handout: MM X
Read:
3.2 Natural and Artificial Computers
​Th 1/21
Handout: ​MM X
Read: Of interest:
  • (C) Lande (2019) "Do you compute?"  (written by a former student from this class!)
Reading Guide
The point of these readings is to get an intuitive idea of the Computational Theory of Mind, aka CTM or Computationalism.

The chapter by Craik is one of the first vivid statements of CTM.   This is a difficult article, but it lays out a deeply insightful vision of how organisms might use neural symbols to negotiate the world, and why this would be such a winning evolutionary strategy.   Read for the big picture.  As you read, ask yourself, what exactly is Craik's "hypothesis" on the nature of thought?

The Pinker reading provides an easier to read and more familiar introduction to CTM.   Pinker frames CTM as a claim about natural computation, i.e. the claim that the brain just is a natural computer.   What does pinker mean by "natural" computation?  What is the difference between natural and artificial computation?
HW2.  Computing with CCs
Due T 1/26, 2PM PST (before class)
4.1 Computational Theory of Mind
T 1/26
​Handout: ​MM X
Read: ​Background:
  • (C) Ravenscroft (2005) Philosophy of Mind, Ch. 6: "The Computational Theory of Mind"
  • (C) Johnson-Laird (1988) "How Should the Mind Be Studied?".  [Trying to find a PDF]
Reading Guide
Note: CTM = Computationalism

The purpose of the McGlaughlin reading is to provide a clear and concise statement of CTM.  After reading the article see if you can define CTM for yourself.   The article also does a nice job of showing how CTM connects to what we have done (logic gates and logic circuits), whats coming up next (levels of computational analysis), and what lies further ahead (intelligent thought).

Unit 2: Levels

4.2 Memory and Sequential Circuits (SCs)
Th 1/28
MM X
​Read:
Reading Guide
The Braitenberg chapter considers how logic and memory might be added to simple machines--- not quite the same machines we've been dealing with, but not so different either.  What is the central intuition behind building a machine with physical memory?  See if you can imagine how to extend Braitenberg's suggestion into a concrete implementation of memory in a logic circuit.

The Know the Code video provides a personable and practical introduction to the workings of computer memory.  You won't be responsible for reconstructing the internal circuitry of a "flip-flop"-- the basis of digital memory-- but do your best to follow along throughout.  The general concepts of memory and time will be important in Unit 2.
5.1 Computing in Time
​​T 2/2
MM 13
​Read:
Reading Guide
Text.
5.2 Computational Power
Th 2/4
MM X
​Read: 
Reading Guide
Text.
HW3.  Computing with SCs
Due T 2/9, 2PM PST (before class)
6.1 State Abstraction
T 2/9
MM X
​Read: ​Of Interest:
Reading Guide
Text.
6.2 Finite State Machines (FSMs)
& the Algorithm Concept
Th 2/11
MM X
Read: 
Reading Guide
Text.
7.1 Levels of Abstraction
T 2/16
MM X
Read:
Reading Guide
Text.
​HW4.  Computing with FSMs
Due 2/18

Unit 3: Cognition

7.2 Turing Machines (TMs)
Th 2/18
MM X
​Read:  Of interest:
Reading Guide
Text.
8.1 Recursive Algorithms
T 2/23
MM X
Read: Of interest:
  • Miller, Galanter, Pribram (1960), "The Unit of Analysis" from Plans and the Structure of Behavior

Reading Guide
Text.
8.2 Computing with TMs
Th 2/25
MM X
​Read:  Gallistel and King, ​Preface
Reading Guide
Text.
​HW5.  Computing with TMs
Due 3/2
9.1 Navigation + Physical Cognition
T 3/2
MM X
Read: 
Reading Guide
Text.
9.2 Machines & Programs
​Th 3/4
MM X
​Read: see announcements at top of page.
Optional:
Reading Guide
Text.
10.1 The Universal Machine
T 3/9
MM X
Read:
  • ​TBA
Of interest:
Reading Guide
Text.
10.2 Computation & Consciousness
Th 3/11
Read: Recommended: Of interest:
Reading Guide
Text.
​HW6.  Navigation with Turbots
Due 3/12, 11:59 PM
​HW7.  Final Project (optional)
Due Thursday March 18, 11:59 PM.
Home     |     Policies     |     Resources     |     CCLE