Meets: MWF 12:00-12:50pm, CR 144
Instructor: Eric Moorhouse, Ross 216
Effective Fri Sept 6, we meet in CR 144 (the square room).
Links/Handouts
- Syllabus/Policies
- Lecture Slides/Videos/Computer sessions
- Classroom Climate and Conduct
- UW Regulation 2-114 on Academic Dishonesty
- Data compression via Huffman codes
- Is entropy the same as disorder? Spend 8 minutes watching this and come to class prepared to discuss.
- Series and Polynomials
- van Lint's introduction to Algebraic Geometric codes (from a 1990 conference) are posted on the WyoCourse site, for copyright reasons
- Bell's Theorem via the CHSH game
- For class discussion during the final week of class (first week of December): Two hat problems (with 2 participants and with 7 participants). Prepare to discuss optimal strategies each of these situations (i) using the limitations of classical information, and (ii) assuming the participants have access to entangled particles to assist in their reasoning. After we discuss Bell's Theorem (and possibly also Superdense Coding) you will have some idea of what a difference EPR pairs can have on our reasoning capabilities! Also you may be curious to compare with an infinite hat problem. I have also posted solutions and comments for the infinite version but please don't read this until you have seriously thought about the problem for yourself. Here are my solutions for the finite hat problems (without using entanglement). What if the administrator is diabolical and rather than assigning hats randomly, tries to minimize the participants' chance of success? Also, what if the participants can make use of entangled particles?
/ revised December, 2024