Welcome (back) and howdy hackers! Looks like Gary will be absent for our first class due to research / travel. Look forward to a general course overview, free food, and a short tech talk about general computing tips to get everyone up to speed.
Outline:
1. Overview
2. Using SSH
3. Using VPN or VPNC
4. What is the difference between CS, SE, and IT?
5. Cool topics in CS - open discussion (Leo the MIT learning robot)
CS-195 students present on their experiences coding in a new language.
* Student Presentations Day 2:
- Rich presents on psychological intelligent agents (such as Eliza)
- John Dimona presents on evolutionary computation.
- John Ross and Jeremy Klein present on hacking guitar effects.
* Student Presentations Day 2:
- Max presents on Bioinformatics
- Michael Huang presents on nano technology
- Alex Castleton presented on the history of AI
* Student Presentations Day 1:
- Dallas presents on military exoskeletons
- Robin and Dan present on Quantum Computing
- Jake presents on arpanet, TCP/IP, dhcp, and dns (networking)
Chris Tucci presents on open source tools to hack automobile smart-chips.
CSSA member Robin Wilke gives a presentation on the History of Computing.
No class! SPRING BREAK!
Bongard on Resilient Machines
Weekly (CSSA) CS-095 / CS-195 meeting Guest Lecturer, Professor Josh Bongard on “Resilient Machines” Intelligent robots must be able to not only adapt an existing behavior on the fly in the face of environmental perturbation, but must also be able to generate new, compensating behavior after severe, unanticipated change such as body damage. In this talk I will describe a physical robot with this latter capability, a capability we refer to as resiliency. The robot achieves this by: (1) creating an approximate simulation of itself; (2) optimizing a controller using this simulator; (3) using the controller in reality; (4) experiencing body damage; (5) indirectly inferring the damage and updating the simulator; (6) re-optimizing a new controller in the altered simulator; and (7) executing this compensatory controller in reality. I will also describe recent work generalizing this approach to robot teams.
Unfortunately due to surgery, Professor Skalka was unable to make it to his talk. Instead Michael, Jake, and Andrew gave a lecture about the practical uses of regular expressions, computer architectures, and the boot sequence of a computer.
- - - - - - - - -
Topic: Curry-Howard Isomorphism By: Professor Chris Skalka The Curry–Howard correspondence is the direct relationship between computer programs and mathematical proofs. Also known as Curry–Howard isomorphism, proofs-as-programs correspondence and formulae-as-types correspondence, it refers to the generalization of a syntactic analogy between systems of formal logic and computational calculi that was first discovered by the American mathematician Haskell Curry and logician William Alvin Howard.