Sp&Hrg 803
Complex Systems in Neurobiology, Language, and Speech



Go Back

Day 3
19 February 1998

Information 1


Summary of this Day's Class

We spent the first part of the class discussing the articles.
This was kept short and we prepared ourselves for Information Theory by reviewing Logarithms. I have included the transparencies below in Word 97, Word 6.0 and pdf formats:
LogRefresher.pdf - PDF Format, 16 kb.
LogRefresher.doc - Word 97 Format, 9 kb.
LogRefresher-6.doc - Word 6.0 Format, 24 kb.

After reviewing logarithms we began an introduction to Information Theory where we were introduced to the idea of surprise, and then the Shannon Information which is the expectation value of the surprise (or loosely speaking - the average surprise). We briefly looked at the relationship between information and entropy.
Download the transparencies for Information Theory Part 1 here:
InfoTheory1.pdf - PDF Format, 12 kb.
InfoTheory1.doc - Word 97 Format, 51 kb.
InfoTheory1-6.pdf - Word 6.0 Format, 147 kb.

Up to the List

Homework Assignment 3 - Due 26 Feb 98

1. Consider a coin and a six-sided die.

2. Calculate the entropy for the following coins (with different probabilities for heads and tails).
Remember that the P(T) = 1 - P(H) so its easy to find P(T) if you know P(H).
a. P(H) = 0.5
c. P(H) = 0.4
d. P(H) = 0.3
e. P(H) = 0.1
f. P(H) = 0.6 (Notice there is a symmetry interchanging H for T)
Graph your results.
Extra: Can you solve it completely for all possible P(H) and graph the entropy vs. P(H)?
(No extra credit will be give for the extra parts. They are just a little more challenging.)

3. Calculate the entropy for a system with four states using Log Base 2.
P(a) = 1/2, P(b) = 1/4, P(c) = 1/8, P(d) = 1/8
Can you see the relation between the entropy and the average number of yes-no guesses you would have to make to determine the state?
Extra: If you could change the probabilities what would give you the maximum entropy and what would its value be?

Up to the List

Reading Assignment - Read the articles by 26 Feb 98

We didn't get quite far enough for Gatlin's discussion of D1, D2, and Redundancy to make much sense so we will discuss Gatlin the following week.
Have emailed comments by NOON Wednesday 25 Feb 98



Gatlin, L.L. 1972. Information Theory and the Living System. Columbia University Press, NY. Chapter 5, pp. 107-116.

Holland, J.H. 1995. Hidden order. How adaptation builds complexity. Addison Wesley Publishing Company, Reading MA, Chapter 2, pp. 41-91.

Pattee, H.H. 1997. The physics of symbols and the evolution of semiotic controls. To be published in: Proceedings volume in the Santa Fe Institute Studies in the Sciences of Complexity. Addison-Wesley, Redwood City CA. Available from
http://ssie.binghamton.edu/~pattee/semiotic.html

Up to the List

Kevin Knuth's Home Page Complex Systems Course Page