Top Banner
K. P de Silva R.V Premabandu 1
37

Foundation of computing history final

Jan 21, 2015

Download

Education

Considers various pioneers and their contribution to the Computing history.
Their Concepts and Theories.
How they became the basis of Computing
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Foundation of computing history final

K. P de Silva

R.V Premabandu1

Page 2: Foundation of computing history final

Introduction

Considers various pioneers and their contribution to the Computing history.

Their Concepts and Theories.

How they became the basis of Computing.

2

Page 3: Foundation of computing history final

Content George Boole

Boolean Algebra

Charles Babbage Difference Engine Analytic Engine

Formalism Alan Turing

Turing Machines Enigma Codes Turing Test in AI

Claude Shannon Boolean Algebra and Switching Circuits Information Theory Cryptography

Von Neumann Von Neumann Architecture.

Konrad Zuse

3

Page 4: Foundation of computing history final

George Boole Nineteenth century mathematician,

His calculus of logic is known as Boolean Algebra.

Introduced two quantities “0” and “1”.

He then employed symbols such as x, y, z, etc., to represent collections or Classes.

Introduced three operators (+ , - , x).

These symbols obeyed a rich collection of algebraic laws such as Additive Identity, Associativity, Commutativity and etc.

(1815–1864)

4

Page 5: Foundation of computing history final

Boolean Algebra

Foundation of all modern computers.

Consists of propositions that are either true or false.

Variables (e.g., A, B, etc.) are used to stand for propositions.

Propositions must be either true or false.

E.g. 2 + 2 = 4 is true.

2 ∗ 5 = 11 is false.

Propositions may be combined using logical connectives to form new propositions.

5

Page 6: Foundation of computing history final

Logical Connectives The standard logical connectives are…

AND - ∧OR - ∨NOT - ¬

These connectives may be expressed using the other logical connectives

Implication (⇒) Equivalence (⇔)

E.g. A ⇒ B is equivalent to ¬A∨BE.g. A ⇔ B is equivalent to (A ⇒ B) ∧ (B ⇒ A)

6

Page 7: Foundation of computing history final

AND, OR and NOT Gates

Boolean logical operations are implemented by electronic AND, OR and NOT gates.

Fundamental building blocks for more complex circuits.

7

Page 8: Foundation of computing history final

Charles Babbage

Charles Babbage is considered to be one of the fathers of computing.

He was interested in a method that calculation could be done mechanically.

Introduced a design concept for Difference Engine and Analytic Engine.

(1791) 8

Page 9: Foundation of computing history final

Difference Engine Built in 1853.

Compute polynomials of degree 4 on 15-digit numbers.

Compute and print mathematical tables mechanically.

The only operation that the Difference Engine can perform is the addition.

Finite differences was the concept of calculating the answers.

A key weakness is that it requires the intervention of humans to perform the calculation.

9

Page 10: Foundation of computing history final

Difference Engine

Difference Engine is on display in the Science Museumin London. 10

Page 11: Foundation of computing history final

Analytic Engine

Babbage proposed a revolutionary idea for analytic engine to resolve weaknesses of difference engine.

Built in 1978.

Included a processor, memory.

Way to input information and output results.

Capable of executing all possible tasks that may be expressed in algebraic notation.

Used punched cards to store programs to perform the analysis and computation in the Analytic Engine.

11

Page 12: Foundation of computing history final

Analytic Engine Punched cards in the design was extremely powerful.

Two types Operation Cards

Variable Cards

Operation cards are used to define the operations.

Variable cards define the variables.

Ada Lovelace suggested to a method write a program in Analytic Engine.

Over 100 years before Von Neumann’s architecture.

12

Page 13: Foundation of computing history final

Analytic Engine

13

Page 14: Foundation of computing history final

Formalism Formalism was proposed by David Hilbert.

This formal system is the basis of modern predicate logic.

A formal system consists of a formal language.

Included axioms, definitions, universal and existential quantification, and formalization of proof.

Determines the truth or falsity of any mathematical statement based on a Algorithm with set of rules.

14

Page 15: Foundation of computing history final

Formalism E.g.1 x = y;

this returns true if x is the same as y, and false otherwise.

E.g.2 More complex expression such as

f (x, y, z) = w is true

if f (x, y, z) is identical with w, and false otherwise.

E.g.3 P(x) returns true if x is prime. where P() is termed a concept.

“P(5) = true”

15

Page 16: Foundation of computing history final

Alan Turing

Was a British mathematician who was highly influential in the development of Computer Science.

Engaged in the Design work in the development of first stored program computer.(ACE)

Introduced the concept of Turing machine.

Designed a electromechanical machine known has bombe to break in to Enigma Codes.

(1912-1954)16

Page 17: Foundation of computing history final

Turing Machine

Turing machine is very simple machine.

Equivalent to an actual physical Computer.

The machine may read from and write to the tape.

Has an associated set of rules that defines its behavior.

Programmed to solve any problem for which there is an algorithm.

It was used to determine the solvability of certain problem.

17

Page 18: Foundation of computing history final

Concept of Turing Machine

18

Page 19: Foundation of computing history final

Enigma Machine & Enigma Codes

The Enigma machine19

Page 20: Foundation of computing history final

Bombe Machine Turing was able brake Enigma codes by his Bombe

machine.

Cardboard replica of bombe. 20

Page 21: Foundation of computing history final

Automated Computer Engine(ACE)

Pilot ACE21

Page 22: Foundation of computing history final

Turing Test Turing devised a famous

experiment that would allow a computer to be judged as a conscious and thinking machine.

The concept of this Turing test was the foundation of Artificial Intelligence.

22

Page 23: Foundation of computing history final

Claude Shannon

Shannon found that Boolean algebra could be employed to simplify the design of circuits and telephone routing switches.

He laid the foundation of modern Information Theory.

Shannon proposed the idea of converting any kind of data to binary digits.

23

Page 24: Foundation of computing history final

Boolean Algebra & Switching Circuits

Switching circuit “Xab” between two terminals a and b

Xab = 0 if open

Xab = 1 if closed

24

Page 25: Foundation of computing history final

Information Theory Sending information rapidly and reliably from the

source point to the destination point without any distraction.

25

Page 26: Foundation of computing history final

Cryptography Secure way of communication between two parties.

Messages are encrypted according to a Mathematical function.

26

Page 27: Foundation of computing history final

John von Neumann Hungarian mathematician.

Made fundamental contributions to a vast number of fields including computer science.

His work on Quantum Mechanics was very influential.

He introduced an Architecture during his work on ENIAC & EDVAC.

27

Page 28: Foundation of computing history final

Von Neumann Architecture

The early machines could perform only a particular task.

This architecture uses a single store for both machine instructions and programs.

Much simpler to reconfigure the computer for a different task.

28

Page 29: Foundation of computing history final

Von Neumann Architecture

29

Page 30: Foundation of computing history final

Manchester Mark I was the first computer with Von Neumann architecture.

Ferranti produced the world’s first commercial computer in 1951.

Von Neumann Architecture

30

Page 31: Foundation of computing history final

Manchester Mark I

31

Page 32: Foundation of computing history final

Konrad Zuse Was a German Engineer.

Pioneered in building first functional tape stored, program-controlled computer.( Z3)

He designed the first high-level programming language Plankalkül.

32

Page 33: Foundation of computing history final

Summary Considered the contributions of important people in

the history of computing including Boole, Babbage, Shannon, Turing and von Neumann.

Boole was an English mathematician who developed Boolean Algebra which is the foundation of all modern computers.

Charles Babbage did pioneering work on the Difference Engine and Analytic Engine.

Turing is famous for his work on a theoretical mathematical machine termed the “Turing Machine”.

33

Page 34: Foundation of computing history final

Summary He also made contributions to the cryptography and to

Artificial Intelligence.

Claude Shannon was the first person to see the applicability of Boolean Algebra to simplify the design of circuits and telephone routing switches.

Von Neumann was a mathematician gave his name to the Von Neumann architecture that is used in almost all computers.

Zuse was a German engineer who developed the Z3 machine in 1941. He also developed the Plankalkulhigh-level programming language in 1946.

34

Page 35: Foundation of computing history final

References A Brief History of Computing by Gerard O’Regan.

www.wikipedia.com

35

Page 36: Foundation of computing history final

Any Questions.. ??

36

Page 37: Foundation of computing history final

37