In this course, the student learns the principles of early computational devices and investigates how the concepts inherent in these devices are implemented in modern computers. Particular attention is focused on Boolean logic, Frege formula language, flow charts, state machines, and Turing machines. The implications of Shannon’s law and Moore’s law are presented.
School of Engineering and Computing
3 hours of lecture per week