Your browser doesn't support the features required by impress.js, so you are presented with a simplified version of this presentation.
For the best experience please use the latest Chrome, Safari or Firefox browser.
CIS 115
Universal Computers
Herman Hollerith
Image Source: Wikipedia
Punched Cards
Image Source: Wikipedia
Hollerith Tabulating Machine
Image Source: Wikipedia
Image Source: Wikipedia
Image Source: Wikipedia
Image Source: Wikipedia
IBM Type 285
Image Source: Wikipedia
Mark I
Image Source: Wikipedia
ENIAC
Image Source: Wikipedia
Top Secret Rosies
Female Computers in WWII
Available for Loan
What is a Universal Computer?
What is a Universal Computer?
A universal computer can simulate ANY other real-world computer given infinite time and infinite memory
Alan Turing
Image Source: Wikipedia
Turing Machine
Image Source: Wikipedia
Turing Machine Instructions
Turing Machine Example
Start with 2 items on a tape
∨ Or
Turing Machine Example
Start with 2 items on a tape
∧ And
John Von Neumann
Image Source: Wikipedia
Von Neumann Architecture
Image Source: Wikipedia
Assignments
Blog 2: Algorithms
There are many important algorithms in Computing Science. In fact, we’re going to learn about many of them later in this class. For now, however, I’d like you to pick an algorithm from Wikipedia’s list of algorithms (https://en.wikipedia.org/wiki/List_of_algorithms) and write about it. Some things you can cover:
Scratch Turing Machine
Lists in Scratch
Get an Item |
Set an Item |
Turing Machine Blocks
Turing Machine - Invert Bits