CT3340/CD5540 Research Methodology for Computer Science and Engineering

History of Computer Science

Gordana Dodig-Crnkovic Department of Computer Science and Engineering Mlardalen University

2003
1

HISTORY OF COMPUTER SCIENCE

LEIBNIZ: LOGICAL CALCULUS BOOLE: LOGIC AS ALGEBRA FREGE: MATEMATICS AS LOGIC CANTOR: INFINITY HILBERT: PROGRAM FOR MATHEMATICS GDEL: END OF HILBERTS PROGRAM TURING: UNIVERSAL AUTOMATON VON NEUMAN: COMPUTER

SCIENCE
Culture
Logic & Mathematics
1

(Religion, Art, ) 5

Natural Sciences (Physics, Chemistry, Biology, ) 2 Social Sciences

(Economics, Sociology, Anthropology, ) 3

The Humanities
(Philosophy, History, Linguistics ) 4

The whole is more than the sum of its parts. Aristotle, Metaphysica 3

21

SCIENCE, RESEARCH, DEVELOPMENT AND TECHNOLOGY

Research

Development Science Technology

4

LEIBNIZ: LOGICAL CALCULUS

Gottfried Wilhelm von Leibniz

Born: 1 July 1646 in Leipzig, Saxony (now Germany) Died: 14 Nov 1716 in Hannover, Hanover (now Germany)
5

LEIBNIZS CALCULATING MACHINE

For it is unworthy of excellent men to lose hours like slaves in the labor of calculation which could safely be relegated to anyone else if the machine were used.
6

LEIBNIZS LOGICAL CALCULUS

DEFINITION 3. A is in L, or L contains A, is the same as to say that L can be made to coincide with a plurality of terms taken together of which A is one. B N = L signifies that B is in L and that B and N together compose or constitute L. The same thing holds for larger number of terms. AXIOM 1. B N = N B. POSTULATE. Any plurality of terms, as A and B, can be added to compose A B. AXIOM 2. A A = A. PROPOSITION 5. If A is in B and A = C, then C is in B. PROPOSITION 6. If C is in B and A = B, then C is in A. PROPOSITION 7. A is in A. (For A is in A A (by Definition 3). Therefore (by Proposition 6) A is in A.) . PROPOSITION 20. If A is in M and B is in N, then A B is in M N.
7

BOOLE: LOGIC AS ALGEBRA

George Boole

Born: 2 Nov 1815 in Lincoln, Lincolnshire, England Died: 8 Dec 1864 in Ballintemple, County Cork, Ireland
8

George Boole is famous because he showed that rules used in the algebra of numbers could also be applied to logic. This logic algebra, called Boolean algebra, has many properties which are similar to "regular" algebra. These rules can help us to reduce an expression to an equivalent expression that has fewer operators.

Properties of Boolean Operations

A AND B A B
A OR B A + B
10

OR Operator
fruits OR vegetables OR cereals Any one of the terms are present.

fruits

vegetables

cereals

11

OR (|)
A B A|B

0
0 1 1

0
1 0 1

0
1 1 1

12

OR Gate
A 0 0 B 0 1 Q 0 1

1 1

0 1

1 1

13

AND Operator
dairy products AND export AND europe All terms are present

14

AND (&)
A 0 0 B 0 1 A&B 0 0

1 1

0 1

0 1
15

AND Gate
A B Q

0 0 1 1

0 1 0 1

0 0 0 1

16

XOR Operator (Exclusive OR)

sheep XOR goats
One or other term is present, but not both.

17

XOR (^)
A B A^B

0 1 1

1 0 1

1 1 0

18

XOR Gate
A 0 0 1 1 B 0 1 0 1 Q 0 1 1 0

19

NOT (~)
A ~A

20

NOT Gate
A 0 1 Q 1 0

21

NAND
A B
NAND

0 1 1

1 0 1

1 1 0

All inputs on = off, else on.

22

NAND Gate
A 0 B 0 Q 1

0
1 1

1
0 1

1
1 0

23

NOR
A B
NOR

0 1 1

1 0 1

0 0 0

Any input on = off, else on.

24

NOR Gate

A 0 0

B 0 1

Q 1 0

1 1

0 1

0 0

25

XNOR
A B
NOR

0 1 1

1 0 1

0 0 1

26

XNOR Gate

A 0 0 1 1

B 0 1 0 1

Q 1 0 0 1

27

FREGE: MATEMATICS AS LOGIC

Friedrich Ludwig Gottlob Frege

Born: 8 Nov 1848 in Wismar, Mecklenburg-Schwerin (now Germany) Died: 26 July 1925 in Bad Kleinen, Germany
28

The Predicate Calculus (1)

In an attempt to realize Leibnizs ideas for a language of thought and a rational calculus, Frege developed a formal notation (Begriffsschrift). He has developed the first predicate calculus: a formal system with two components: a formal language and a logic.

29

The Predicate Calculus (2)

The formal language Frege designed was capable of: expressing predicational statements of the form x falls under the concept F and x bears relation R to y, etc., complex statements such as it is not the case that ... and if ... then ..., and quantified statements of the form Some x is such that ...x... and Every x is such that ...x....

30

The Analysis of Atomic Sentences and Quantifier Phrases

Fred loves Annie. Therefore, some x is such that x loves Annie. Fred loves Annie. Therefore, some x is such that Fred loves x.
Both inferences are instances of a single valid inference rule.

31

Proof
As part of his predicate calculus, Frege developed a strict definition of a proof. In essence, he defined a proof to be any finite sequence of well-formed statements such that each statement in the sequence either is an axiom or follows from previous members by a valid rule of inference.

32

CANTOR: INFINITY

Georg Ferdinand Ludwig Philipp Cantor

Born: 3 March 1845 in St Petersburg, Russia Died: 6 Jan 1918 in Halle, Germany
33

Infinities
Set of integers has an equal number of members as the set of even numbers, squares, cubes, and roots to equations!
The number of points in a line segment is equal to the number of points in an infinite line, a plane and all mathematical space!

The number of transcendental numbers, values such as and e that can never be the solution to any algebraic equation, were much larger than the number of integers.
34

Hilbert described Cantor's work as:- ...the finest product of mathematical genius and one of the supreme achievements of purely intellectual human activity.

35

HILBERT: PROGRAM FOR MATHEMATICS

David Hilbert

Born: 23 Jan 1862 in Knigsberg, Prussia (now Kaliningrad, Russia) Died: 14 Feb 1943 in Gttingen, Germany
36

Hilbert's program
Provide a single formal system of computation capable of generating all of the true assertions of mathematics from first principles (first order logic and elementary set theory).
Prove mathematically that this system is consistent, that is, that it contains no contradiction. This is essentially a proof of correctness. If successful, all mathematical questions could be established by mechanical computation!
37

GDEL: END OF HILBERTS PROGRAM

Kurt Gdel

Born: 28 April 1906 in Brnn, Austria-Hungary (now Brno, Czech Republic) Died: 14 Jan 1978 in Princeton, New Jersey, USA
38

Incompleteness Theorems
1931 ber formal unentscheidbare Stze der Principia Mathematica und verwandter Systeme.
In any axiomatic mathematical system there are propositions that cannot be proved or disproved within the axioms of the system.

In particular the consistency of the axioms cannot be proved.

39

TURING: UNIVERSAL AUTOMATON

Alan Mathison Turing

Born: 23 June 1912 in London, England Died: 7 June 1954 in Wilmslow, Cheshire, England
40

When war was declared in 1939 Turing moved to work fulltime at the Government Code and Cypher School at Bletchley Park. Together with another mathematician W G Welchman, Turing developed the Bombe, a machine based on earlier work by Polish mathematicians, which from late 1940 was decoding all messages sent by the Enigma machines of the Luftwaffe.

41

At the end of the war Turing was invited by the National Physical Laboratory in London to design a computer.
His report proposing the Automatic Computing Engine (ACE) was submitted in March 1946. Turing returned to Cambridge for the academic year 194748 where his interests ranged over topics far removed from computers or mathematics, in particular he studied neurology and physiology.
42

1948 Newman (professor of mathematics at the University of Manchester) offered Turing a readership there.
Work was beginning on the construction of a computing machine by F C Williams and T Kilburn. The expectation was that Turing would lead the mathematical side of the work, and for a few years he continued to work, first on the design of the subroutines out of which the larger programs for such a machine are built, and then, as this kind of work became standardised, on more general problems of numerical analysis.
43

1950 Turing published Computing machinery and intelligence in Mind

1951 elected a Fellow of the Royal Society of London mainly for his work on Turing machines by 1951 working on the application of mathematical theory to biological forms. 1952 he published the first part of his theoretical study of morphogenesis, the development of pattern and form in living organisms.
44

VON NEUMAN: COMPUTER

John von Neumann

Born: 28 Dec 1903 in Budapest, Hungary Died: 8 Feb 1957 in Washington D.C., USA
45

In the middle 30's, Neumann was fascinated by the problem of hydrodynamical turbulence. The phenomena described by non-linear differential equations are baffling analytically and defy even qualitative insight by present methods. Numerical work seemed to him the most promising way to obtain a feeling for the behaviour of such systems. This impelled him to study new possibilities of computation on electronic machines ...

46

Von Neumann was one of the pioneers of computer science making significant contributions to the development of logical design. Working in automata theory was a synthesis of his early interest in logic and proof theory and his later work, during World War II and after, on large scale electronic computers. Involving a mixture of pure and applied mathematics as well as other sciences, automata theory was an ideal field for von Neumann's wide-ranging intellect. He brought to it many new insights and opened up at least two new directions of research.
47

He advanced the theory of cellular automata, advocated the adoption of the bit as a measurement of computer memory, and solved problems in obtaining reliable answers from unreliable computer components.

48

Computer Science Hall of Fame

Charles Babbage

Ada Countess of Lovelace

Axel Thue

Stephen Kleene

Julia Robinson

Noam Chomsky

Juris Hartmanis

John Brzozowski 49

Computer Science Hall of Fame

Richard Karp

Donald Knuth

Manuel Blum

Stephen Cook

Sheila Greibach

Leonid Levin 50

COMPUTING Overall structure of the CC2001 report

51

Technological advancement over the past decade

The World Wide Web and its applications Networking technologies, particularly those based on TCP/IP Graphics and multimedia Embedded systems Relational databases Interoperability Object-oriented programming The use of sophisticated application programmer interfaces (APIs) Human-computer interaction Software safety Security and cryptography Application domains
52

Overview of the CS Body of Knowledge

Discrete Structures Programming Fundamentals Algorithms and Complexity Programming Languages Architecture and Organization Operating Systems Net-Centric Computing Human-Computer Interaction Graphics and Visual Computing Intelligent Systems Information Management Software Engineering Social and Professional Issues Computational Science and Numerical Methods
53