Session 7 :: Repetitio
click, swipe or press → to begin
Order of the day
- Repetitio I:: Zuse computers
- Exercitio I:: Binary counting
- Presentatio I :: Notes of Augusta Ada Byron King
- Questiae
- Presentatio II :: Binary adder
- Exercitio II :: Binary adder on Your hands
- Presentatio III: Digitale Klang in Alltag
The Goal of this course
... is to make You experience main operatory principles of information-processing machines.
Zuse Z1
Note: rod logic (shall be used in nano-computers) operates in the same wayZuse Z3
Lady Ada
Questiae (group work)
- What is a representation ?
- What is an algorithm ?
- What is a digit ?
- What is a machine ?
Presentatio II. : Binary adder
Binary adder on Your hands: transition rules
| Rule | Input R | Input L | Input Carry | Output | Output Carry |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 | 0 |
| 2 | 0 | 1 | 0 | 1 | 0 |
| 3 | 1 | 1 | 0 | 0 | 1 |
| 4 | 0 | 0 | 1 | 1 | 0 |
| 5 | 1 | 0 | 1 | 0 | 1 |
| 6 | 0 | 1 | 1 | 0 | 1 |
| 7 | 1 | 1 | 1 | 1 | 1 |
Binary adder algorithm
- Init: Set up Your inputs. Carry is zero.
- Start from the rightmost position (represented by thumb).
- Apply the transition rule (if necessary, flip the carry to an opposite state).
- Set the output bit of the current position.
- Proceed to higher position (following finger).
- HALT if carry and all inputs are zero, otherwise repeat steps 2-6
