Video Tutorials!
See the
CPSC201 Yale channel at Youtube. There are new videos for hw5!
CS 201 Video Contest
In the tradition of the
racket/beat it song we have a song for Turing Machines:
Would It Be Computable? to the
tune of "Wouldn't It be Loverly?" from My Fair Lady.
You are invited to create a music video for this song. Here are
the rules:
- The winning
submission will receive 10 homework points for each member of the team.
- Runners-up will receive 5 homework points for each member of the team.
- Each team may have up to 4 CS 201 students. Non-CS 201
students may also contribute, but they would not receive any points.
- CS 201 students may be on at most one team.
- If there are multiple submissions, we will have a vote in class
to select the winner.
- Submissions are due by midnight Monday, November 4th.
- If you are planning to submit a video, send me a note before Halloween
with the members of your team.
Gates and Circuits.
The Architecture of Complexity Herbert Simon, 1962.
Ontological Argument for the Existence of God
Bel: a new LISP style programming language
Gates and Circuits lecture
notes addition
Getting to know UNIX
UNIX
Introduction principle 4
[Home]
