Introduction to Computer Systems

Similar documents
Chapter 01: Introduction. Lesson 01 Evolution Computers Part 1: Mechanical Systems, Babbage method of Finite Difference Engine and Turing Hypothesis

CS187 - Science Gateway Seminar for CS and Math

Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death

How Does Nature Compute?

What is a Computer? computer: anything that is able to take a mathematically

complex networks and systems i609: advanced PhD seminar I Informatics luis rocha 2019 INDIANA UNIVERSITY

The History of ENIAC

ASSC = Automatic Sequence-Controlled Calculator (= Harvard Mark I) Howard Aitken, 1943

History & Binary Representation

Binary addition example worked out

Introduction. Chapter Computation and science

MACHINE COMPUTING. the limitations

Week No. 06: Numbering Systems

1 Computing System 2. 2 Data Representation Number Systems 22

ww.padasalai.net

CHAPTER 2 NUMBER SYSTEMS

Keith Fligg. 03-April-07

Unit 4: Computer as a logic machine

Electrical Circuits. Winchester College Physics. makptb. c D. Common Time man. 3rd year Revision Test

Chapter 3: Inequalities

20. Combinational Circuits

Lecture 24. A Brief History of Computer Science (with thanks to Prabhakar Ragde) CS125 Course Notes Lecture 24, Slide 1

Can a Machine Think?

GREENWOOD PUBLIC SCHOOL DISTRICT 3 Grade Math Pacing Guide

ELEC Digital Logic Circuits Fall 2014 Switching Algebra (Chapter 2)

MAA509: Quantum Computing and Information Introduction

Virtualization. Introduction. G. Lettieri A/A 2014/15. Dipartimento di Ingegneria dell Informazione Università di Pisa. G. Lettieri Virtualization

GCSE AQA Mathematics. Numbers

Turing Machines Decidability

Lecture 22 Chapters 3 Logic Circuits Part 1

Universal Turing Machine. Lecture 20

Digital Systems Roberto Muscedere Images 2013 Pearson Education Inc. 1

biologically-inspired computing lecture 14 Informatics luis rocha 2015 biologically Inspired computing INDIANA UNIVERSITY

Announcements. Problem Set 6 due next Monday, February 25, at 12:50PM. Midterm graded, will be returned at end of lecture.

Can You Count on Your Computer?

First Draft of a Report on the EDVAC *

CSC103 How Computers Work

Digital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit

Applications. Smartphone, tablet, game controller, antilock brakes, microprocessor, Wires

Computer Organization I CRN Test 3/Version 1 CMSC 2833 CRN Spring 2017

! Chris Diorio. ! Gaetano Borrielo. ! Carl Ebeling. ! Computing is in its infancy

Prime Clocks. Michael Stephen Fiske. 10th GI Conference on Autonomous Systems October 23, AEMEA Institute. San Francisco, California

Turing Machines. COMP2600 Formal Methods for Software Engineering. Katya Lebedeva. Australian National University Semester 2, 2014

Scientific Notation. Chemistry Honors

Numbers and Arithmetic

Intro To Digital Logic

Computer Science. 19. Combinational Circuits. Computer Science COMPUTER SCIENCE. Section 6.1.

How long is the arrow?

Chapter 2 Combinational Logic Circuits

Sorting. CMPS 2200 Fall Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

CS 135. Designing Functional Programs

Digital Electronics Part 1: Binary Logic

How to teleport your cat?

CSE370: Introduction to Digital Design

2.1 Computational Tractability

CprE 281: Digital Logic

Park Forest Math Team. Meet #3. Algebra. Self-study Packet

19 Lorenz Cipher Machine

Sorting. CS 3343 Fall Carola Wenk Slides courtesy of Charles Leiserson with small changes by Carola Wenk

Computer Science. 20. Combinational Circuits. Computer Science COMPUTER SCIENCE. Section

Boolean Algebra & Digital Logic

Cristina Nita-Rotaru. CS355: Cryptography. Lecture 4: Enigma.

EECS150 - Digital Design Lecture 21 - Design Blocks

Logic Theory in Designing of Digital Circuit & Microprocessor

Energy. E d. Energy Power = time. E t P = E t = P

8 th Grade Algebra 1 (Honors) Subject

UNIVERSITI TENAGA NASIONAL. College of Information Technology

CS5371 Theory of Computation. Lecture 10: Computability Theory I (Turing Machine)

Chapter 1 :: From Zero to One

Park Forest Math Team. Meet #3. Self-study Packet

IOP2601. Some notes on basic mathematical calculations

We say that the base of the decimal number system is ten, represented by the symbol

EXEMPLAR NATIONAL CERTIFICATE (VOCATIONAL) ELECTRICAL PRINCIPLES AND PRACTICE NQF LEVEL 3 ( ) (X-Paper) 09:00 12:00

Implementation of Boolean Logic by Digital Circuits

Math 20 Spring Discrete Probability. Midterm Exam

A Universal Turing Machine

INTRO TO MATH PROGRAMMING MA/OR 504, FALL 2015 LECTURE 11

EECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs. Cross-coupled NOR gates

UNIVERSITY OF BOLTON SCHOOL OF ENGINEERING MSC SYSTEMS ENGINEERING AND ENGINEERING MANAGEMENT SEMESTER 2 EXAMINATION 2015/20016

The University of Georgia Department of Physics and Astronomy Graduate Qualifying Exam Part I (Dated: August 9, 2010)

Economic and Social Council Distr. LIMITED

ELCT201: DIGITAL LOGIC DESIGN

CPE100: Digital Logic Design I

E40M. Binary Numbers. M. Horowitz, J. Plummer, R. Howe 1

(a) Definition of TMs. First Problem of URMs

Lecture notes on Turing machines

Lecture (02) NAND and NOR Gates

ENGIN 112 Intro to Electrical and Computer Engineering

Conversions between Decimal and Binary

Form #425 Page 1 of 6

CURRICULUM MAPPING EXAMPLES. Topic: Key Concepts Activities/Demonstrators/Connections (Key Vocabulary in Bold Print)

Chemistry Basic Science Concepts. Observations: are recorded using the senses. Examples: the paper is white; the air is cold; the drink is sweet.

ELCT201: DIGITAL LOGIC DESIGN

ECE260: Fundamentals of Computer Engineering

1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output.

Self-reproducing programs. And Introduction to logic. COS 116, Spring 2012 Adam Finkelstein

Lesson 3: Networks and Matrix Arithmetic

Why digital? Overview. Number Systems. Binary to Decimal conversion

Numerical Methods Lecture 2 Simultaneous Equations

Chapter 5 Simplifying Formulas and Solving Equations

Transcription:

Introduction to Computer Systems Department of Computer Science and Information Systems Lecturer: Steve Maybank sjmaybank@dcs.bbk.ac.uk Spring 2018 Week 1a: History of Computing 9 January 2018 Birkbeck College, U. London 1

Hardware for Evaluating 1+2 Brain Abacus rods and beads Mechanical rods and gears Electromechanical electromagnets open and close switches Vacuum tubes Transistors and integrated circuits 9 January 2018 Birkbeck College, U. London 2

Abacus Chinese abacus Russian abacus https://en.wikipedia.org/wiki/abacus 9 January 2018 BB Section 0.2 3

Pascal s Calculator: the Pascaline Addition and subtraction only. Image from http://www.tcf.ua.edu/az/ithistoryoutline.htm See How the Pascaline works on You Tube 9 January 2018 Birkbeck College, U. London 4

Subtraction Using the Pascaline 1 Use 9 s complement to convert the subtraction to addition The nine s complement C(a) of a single digit a is C a = 9 a Examples: C 2 = 7, C 3 = 6. Note that C C a = a a b = C(C a + b) Example: 4 3 = C C 4 + 3 = C 9 4 + 3 = C 8 = 1 9 January 2018 Birkbeck College, U. London 5

Subtraction Using the Pascaline 2 Prove that if a, b are single digits and a b, then a b = C(C a + b) Proof: C a b = 9 a b = 9 a + b = C a + b a b = CC a b = C C a b = C C a + b Example: a = 7, b = 1 C a = 2, C a + b = 3 a b = C 3 = 6 9 January 2018 Birkbeck College, U. London 6

Difference Engine Early computer for squaring numbers, and much more. Numerical results printed out in the form of tables. Designer: Charles Babbage (1791-1871) 1821: plans for a Difference Engine. 1832: partially built by Joseph Clement. 1834: plans for a more advanced computer, the programmable Analytical Engine. Never built. See http://en.wikipedia.org/wiki/charles_babbage 9 January 2018 BB Section 0.2 7

Why Differences? Differences are used to evaluate polynomials. Three examples of polynomials: 1, x + 1, 1 + x x x/2 Notation in computing: f x = 1 + 3 x x x Notation in mathematics: f x = 1 + 3x x 2 Evaluation: f 2 = 1 + 3 2 2 2 = 3 9 January 2018 Birkbeck College, U. London 8

Example of Differences f x = x 2 First difference 1 = f 1 f 0 = 1 2 = f 2 f 1 = 3 3 = f 3 f 2 = 5 Second difference 2 1 = 2 3 2 = 2 4 3 = 2 First difference in symbols: f x + 1 f x = x + 1 2 x 2 = 2x + 1 9 January 2018 Birkbeck College, U. London 9

Evaluation of x 2 Using Differences x x*x 1 st difference 2 nd difference 0 0 1 1 1 2 4 3 2 3 9 5 2 4 16 7 2 5 25 9 2 Find the differences: Δ x + 1 = Δ x + 2 Find the values of x x: x + 1 x + 1 = Δ x + x 2 9 January 2018 Brookshear Section 0.2 10

Why Polynomials? function 0.7 log 0.6 0.5 polynomial 0.4 0.3 0.2 0.1 0.2 0.4 0.6 0.8 1.0 x Polynomials are used to approximate more complicated functions, e.g. if x is small, log 1 + x x x 2 /2 9 January 2018 Birkbeck College, U. London 11

Modern Construction of a Difference Engine Engine constructed from Babbage s designs by the Science Museum https://en.wikipedia.org/wiki/difference_engine 9 January 2016 Birkbeck College, U. London 12

Lego Version of the Difference Engine Built by Andrew Carol http://acarol.woz.org/difference_engine.html 9 January 2018 Birkbeck College, U. London 13

Code Breaking Machine Replica of the Bombe used at Bletchley Park Original design (1939): Alan Turing Gordon Welchman Electromechanical, specialised only for breaking the Enigma code https://en.wikipedia.org/wiki/cryptanalysis_of_the_enigma 9 January 2018 Birkbeck College, U. London 14

Electromechanical Computer 1 st fully automatic computer. Vol16x2.4x0.6 m 3, weight 4500 Kg. Instructions read from punched paper. Store: 72 nums. of 23 dec. digits. Speed: + or - 0.3 s., * 6 s., / 15.3 s. http://en.wikipedia.org/wiki/harvard_mark_1 H. Aiken, 1944 9 January 2018 Birkbeck College, U. London 15

ENIAC 18,000 vacuum tubes Vol 30x2.4x0.9 m 3, Weight 27000 Kg Data input: card reader. Volatile store: twenty 10 digit decimal nos. Read only store: 100 nos. Programming: rewire Speed: + or 0.2 ms, * 3 ms, / 25 ms. http://en.wikipedia.org/wiki/eniac J. Presper-Eckert and J. Mauchley 9 January 2018 Birkbeck College, U. London 16

Computing at Birkbeck 1945: Andrew Booth recruited by J.D. Bernal to work on mathematical methods for inferring crystal structure from X-rays. 1946-: builds series of computers, Automatic Relay Computer (ARC), ARC2, SEC, 1957: establishes Department of Numerical Automation at Birkbeck See http://www.dcs.bbk.ac.uk/50years/50yearsofcomputing.pdf 9 January 2018 Birkbeck College, U. London 17

Computing at Birkbeck MSc student Norman Kitz working on the SEC (Simple Electronic Computer) at Birkbeck (1949). http://www.dcs.bbk.ac.uk/ 50years/50yearsofcomputing.pdf 9 January 2018 Birkbeck College, U. London 18

Computing Game Tom has a game in which he pretends to be a computer 9 January 2018 Birkbeck College, U. London 19

Equipment 10 5 1 12-3 -1 11 0 1 2 3 4 5 6 A set of boxes Each box has a name: 0, 1, 2, Each box contains a piece of paper with a single number on it, e.g. box 0 contains 10 9 January 2018 Birkbeck College, U. London 20

Instructions Tom carries out instructions such as: Add the number in box 0 to the number in box 2, then put the result in box 2, i.e. make the result the new number in box 2. Subtract the number in box 1 from the number in box 0. Put the result in box 0. Multiply the number in box 1 with the number in box 3. Put the result in box 4. 9 January 2018 Birkbeck College, U. London 21

Observations The computer consists of a memory (the boxes), a device for changing the contents of the memory (Tom) and a list of instructions. The instructions are simple and there are only a few types (so far add, subtract and multiply). The instructions are carried out one at a time. There is no limit to the number of instructions which are carried out (Tom never gets tired). 9 January 2018 Birkbeck College, U. London 22