1. History of Computing – Founders re. PLs
Prof. Steven A. Demurjian
Computer Science & Engineering Department
The University of Connecticut
371 Fairfield Way, Box U-255
Storrs, CT
(860) 486–4818 (Office)
(860) (CSE Office)

2. Highlighting Contributions of Founders
Pioneers of Computing
Major Historical Figures:
Charles Babbage, Ada Lovelace, John Backus
Noam Chomsky, Edsger Dijkstra, Alan Turing
Richard Hamming, Marvin Minsky, Grace Hopper
John von Neumann, Frederick Alonzo Church,
Additional Figures:
Tim Berners-Lee, Edgar F. Codd, Margaret Hamilton, Donald Knuth, Bill Gates
Lesley Lamport, John McCarthy, Barbara Liskov, Alan Kay, Stephen Cook, Seymour CrayACM Turing Awards

3. https://en.wikipedia.org/wiki/Turing_Award
ACM Turning Awards

4. Charles Babbage
Designed
Analytical Engine
Ada Lovelace
First Programmer

5. First General-Purpose Automated Digital Computer
Charles Babbage
Charles Babbage
Analytical Engine
Charles Babbage, its father.
Analytical Engine
It was never completed by Babbage, due to a lack of standardized parts.
English mathematician
Frustrated genius
One of the most interesting characters in the history of computers.

6. Central Processing Unit
Analytical Engine
CPU
Central Processing Unit
Primary Storage
1, –digit numbers
ALU
< > = + -
Control Unit
Analytical Engine
Input
Cards
Output
Cards
Secondary Storage
Data on Cards

7. First General-Purpose Automated Digital Computer
Charles Babbage
Analytical Engine
Characteristics continued:
Arithmetic operations were performed automatically, without the intervention of a human operator.
Controlled by a computer program:
Read one card at a time, executed the instruction it contained, then read read the next card, and so on...
Branched within the program under the control of the ALU.

8. Ada Lovelace Augusta Ada Byron, Lady of Lovelace, Dec 15, 1815
Born to Anna Isabella Milbanke and George Gordon Noel Byron
Ada was privately home schooled in mathematics and science
Died November 27, 1852at the age of 36 in London, England
She was bled to death by her physicians, who were trying to treat her uterine cancer

9. What’s their invention?
She is known as the first programmer, because she wrote a description of Charles Babbage’s early mechanical general-purpose computer, the analytical engine
Ada’s Bernoulli calculation program for specialized calculus operations achieves correct values in today’s computers

10. What technological Advances/Developments came about because of their invention?
The computer language Ada, created by the U.S. Defense Department, was named after Lovelace. The reference manual for the language was approved on December 10, 1980, Ada's birthday,
and the Department of Defense Military Standard for the language, "MIL-STD-1815" was given the number of the year of her birth

11. Did someone help with the invention or who used the innovation process to enhance this development?
Ada wrote a program for the Analytical Engine on her own, but she heard a lecture about the difference engine designed by Charles Babbage
Ada was inspired her to write her own program based on his lecture

12. Works Cited
Ada, Countess of Lovelace: Byron’s Legitimate Daughter. Doris Langley Moore. New York: Harper & Row, 1977.
Ada, the Enchantress of Numbers. Betty A. Toole. Sausilito, Calif.: Strawberry Press, 1992.
The Calculating Passion of Ada Byron. Joan Baum. Hamden, Conn.: Archon Books/ The Shoe String Press, 1986.

13. Computational Linguistics INTroduction
Lecture 1
Computers and Language

14. Noam Chomsky
Noam Chomsky’s work in the 1950s radically changed linguistics, making syntax central.
Chomsky has been the dominant figure in linguistics ever since.
Chomsky invented the generative approach to grammar.
Feb MR
CLINT - Lecture 1

15. Grace Hopper By: Joyce Blasingame Teacher Mathematician
Computer Scientist
Inventor
Systems Designer
Software Programmer
Marketing Whiz
Military Leader
Grace Hopper

16. Grace Brewster Murray Hopper
December 9, 1906 – January 1, 1992
Married in 1930
Husband died in 1945
1928 BA from Vassar College
1930 MA from Yale University
1934 PhD from Yale University
Grace Hopper was born Grace Brewster Murray on December 9, 1906 in New York City. She died January 1, 1992 in Arlington, Virginia. She married educator, Vincent Foster Hopper in He died in 1945 during World War II.

17. Admiral Hopper 1943 United States Naval Reserve
Harvard’s Computation Laboratory
Senior Mathematician at Eckert-Mauchly Computer Corporation
Sperry Corporation
Leader in the NDAC
Retired from Navy with rank Rear Admiral, Senior Consultant to DEC
Two years before her husband’s death, Grace took a leave of absence from Vassar College, and joined The United States Naval Reserve at the age of 37. She was assigned to the Bureau of Ordnance Computation Project at Harvard University. She began her work at Harvard's Cruft Laboratories on the Mark series of computers. (the first large scale digital computer) The Mark I was 51 feet long, eight feet high, and eight feet wide. In 1946, she resigned from her leave of absence from Vassar to become a research fellow in engineering and applied physics at Harvard's Computation Laboratory. In 1949, she joined the Eckert-Mauchly Computer Corporation as a Senior Mathematician. EMCC was purchased by Remington Rand in 1950, and later merged into the Sperry Corporation in In 1967, she became leader in the Naval Data Automation Command. In 1986, she involuntarily retired from the Navy, and was appointed the rank Rear Admiral by President Ronald Reagan. She immediately became a senior consultant to Digital Equipment Corporation, and continued working until she died in her sleep in 1992.

18. Compiler
Grace’s biggest contribution to computing was the invention of the compiler.
In 1952 the A-0 Compiler was completed.
Grace’s biggest contribution to computing was the invention of the compiler. A compiler is a program that translates another program written in a high-level language into machine language so that it can be executed. In 1952 the A-0 Compiler was completed.

19. First Computer “Bug”
In 1951, Grace discovered the first computer "bug.“
A real moth found inside the computer.
She removed the bug, and taped it into the UNIVAC I logbook.
Origin of “Bug”
In Smithsonian
In 1951, Grace discovered the first computer "bug.“ It was a real moth found inside the computer. She removed the bug, and taped it into the UNIVAC I logbook. This is where the term “bug” came from.

20. Military Medals
Defense Distinguished Service Medal Meritorious Service Medal American Campaign Medal World War II Victory Medal National Defense Service Medal Armed Forces Reserve Medal with two Hourglass Devices Naval Reserve Medal
Admiral Hopper received many significant honors and awards throughout her lifetime. Military Medals in which she received are the Distinguished Service Medal, the Meritorious Service Medal, the American Campaign Medal, the World War II Victory Medal, the National Defense Service Medal, the Armed Forces Reserve Medal, and the Naval Reserve Medal. The Defense Distinguished Service Medal is the highest award given by the Department of Defense.

21. Resources
Resources

22. Alonzo Church June 14, 1903 – August 11, 1995
American mathematician and logician
Made major contributions to:
Mathematical logic and the
Foundations of theoretical computer science
web.eng.fiu.edu/~arellano/1002/Computers/Presentation1.ppt

23. Alonzo Church He is best known for the lambda calculus,
is a formal system for function definition, function application and recursion
smallest universal programming language of the World
It is equivalent to Turing machines. However, it emphasizes the use of transformation rules and does not care about the actual machine implementing them
Underlies LISP, ML, etc.
Church–Turing thesis,
Frege–Church ontology, and the
Church–Rosser theorem.

24. Church–Turing Thesis
Informally it states that if an algorithm (a procedure that terminates) exists then there is an equivalent
Turing machine,
recursively-definable function,
or applicable λ-function,
for that algorithm.
Today the thesis has near-universal acceptance

25. Alonzo Church: Mathematician. Philosopher. Computer Scientist?
Alonzo Church is a mathematician and philosopher who developed the very first computer programming language known as Lambda Calculus. Church also worked with Alan Turing in the Church-Turing Thesis, which also was another huge impact on the world of computer science.
“He was a pioneer in the field of mathematical logic and the theory of computation” -Alan Turing
LAMBDA CALCULUS
Lambda (λ) Calculus is a system that is in the world of math logic and computer science for creating a computation by way of combining variables using abstraction. Today, λ Calculus has applications in several different areas: mathematics, philosophy, linguistics, and computer science. λ Calculus, along with Alan Turing’s Turing machine are important models in computation.
EX: Start with the function: 2x
Rewritten in Lambda as λx[2x]
Now solve this when x=3.
λx[2x](3)
[2x](3)
[2(3)]
= 6
ACCOMPLISHMENTS
Church died in 1995 being a well decorated man in the math and computer science world. He earned a Ph.D. from Princeton University. His contributions to number theory and the theories of algorithms and computation laid a solid foundation to computer science.
CHURCH TURING THESIS
The Church-Turing thesis states that any real-world computation can be written into an equivalent computation involving a Turing Machine.
wiki.western.edu/mcis/images/3/3f/Alonzo_Church_draft1.ppt

26. Tim Berners Lee By Jack Neus
socialstudiesorange.pbworks.com/f/Tim+Berners+Lee.ppt

27. What did he do?
He invented the World Wide Web, which linked hypertext with TCP and DNS.
He invented W3 while working in CERN, a physics lab in Switzerland.
Hypertext is the idea of jumping from one document to another. A web page is a document too.
TCP and DNS were the early versions of WWW. That was what was used to create the first .

28. Who was he? Tim Berners Lee was born on June 8, 1955.
Tim Berners Lee graduated from Oxford University.
Tim Berners Lee was 35 in 1989, when he first created the world wide web.
Tim Berners Lee lives in London, England.
Tim Berners Lee is now the president of W3C.

29. Company Statistics
Tim Berners Lee founded W3C, otherwise known as the WWW Consortium.
The company is private. You cannot buy shares of it.
The company was founded in 1994.
The business was a first of its kind, finally introducing things like web pages.

30. Why so much success?
Tim Berners Lee invented WWW, which allowed web pages to work. Before that, there was still , but it was just an application. There was no hundred million different pages, there was just a white square where you typed your text and then sent it.

31. Why so much success?
Almost every business has benefited from W3, because now they can make web sites with a web of pages where consumers can learn about their product.
Many other computer companies have been inspired by W3. This is where Microsoft came from. They realized what HTML could do, and they did A LOT with it.

32. Ten Interesting Computer Scientists
Ten Interesting Computer Scientists
Dr. Raymond Greenlaw
Armstrong Atlantic State University
School of Computing

33. History of Computer Science
1673 – Gottfried Wilhelm von Leibniz invents a machine to do multiplication
1821 – Charles Babbage builds a machine to calculate exponential functions, begins designing Analytical Engine
1832 – Ada Lovelace begins writing programs (on punch cards) for the nonexistent Analytical Engine, inventing such concepts as loops and subroutines
1935 – Alan Turing defines a model for computation

34. History of Computer Science
1937 – Claude Shannon links Boolean logic to digital circuit design
1939 – Turing’s work plays a key role in breaking the Germans’ Enigma code machine
1943 – Small computers are being built in multiple countries
1950 – Turing proposes a test of machine intelligence, the Turing test
1956 – John McCarthy coins the term “artificial intelligence”

35. History of Computer Science
1957 – FORTRAN is released by John Backus and the IBM team
1958 – John McCarthy invents Lisp
1959 – John Backus and Peter Naur propose the use of context-free grammars to describe programming languages
1961 – Edsger Dijkstra applies the semaphore principle used in train signaling systems to mutual exclusion in computer operations

36. History of Computer Science
1962 – Donald Knuth begins work on The Art of Computer Programming
1971 – Alan Kay develops the first object-oriented programming language, Smalltalk
1971 – Stephen Cook publishes a paper on non-deterministic polynomial completeness (NP-completeness), defining a new family of problems that is not computable in a practical sense

37. History of Computer Science
1973 – Leonid Levin publishes a paper identifying the class of NP-complete problems independently of Cook (research was conducted in 1971)
1977 – Leslie Lamport defines a model of time for distributed systems based on a partial order of events
1980 – Microsoft is founded, helping to push PCs into widespread use with the public

38. John Backus
“We simply made up the language as we went along. We did not regard language design as a difficult problem, merely a simple prelude to the real problem: designing a compiler which could produce efficient programs...”

39. Biography - John Backus
1949 – Graduated from Columbia University with a B.S. in Mathematics
1950 – Joined IBM and worked on the SSEC (Selective Sequence Electronic Calculator) for three years
Collaborated with Peter Naur to create Backus-Naur Form
Developed FP which helped push functional programming
Retired in 1991

40. Achievements - John Backus
Designer of FORTRAN
Backus-Naur Form
Designed FP, a functional programming language
1977 – Turing Award winner
1987 – named an IBM Fellow
1993 – awarded a Draper Prize

41. Trivia - John Backus
Has a plate in his head of his own design after having a bone tumor
Roughly half the work of designing FORTRAN went into generating efficient machine code
After retiring in 1991, has completely withdrawn from computer science
Practices meditation

42. Edsger Dijkstra
"Computer Science is no more about computers than astronomy is about telescopes."

43. Biography - Edsger Dijkstra
Studied physics at the University of Leiden
1970s – Worked as a research fellow for Burroughs Corporation
Worked at the Eindhoven University of Technology in the Netherlands
Held the Schlumberger Centennial Chair in Computer Sciences at the University of Texas at Austin
Retired in 2000
Died August 6, 2002

44. Achievements - Edsger Dijkstra
Dijkstra’s algorithm (shortest path) which has been used to solve numerous routing problems
The semaphore construct which helped solve the problem of critical regions
Formulated the dining philosophers problem
1972 – Turing Award winner
Has archive of technical papers at University of Texas at Austin

45. Trivia - Edsger Dijkstra
At age 12, attended Gymnasium Erasminium, an elite Dutch high school
“Go To Statement Considered Harmful” was the revised title by Niklaus Wirth (then editor of CACM), originally titled “A case against the goto statement”
On team to invent first compiler for ALGOL 60, made a deal with collaborator not to shave until project was complete, kept the beard until his death

46. Trivia - Edsger Dijkstra
Dining Philosophers
Imagine that five philosophers are sitting around a table. Before each is a bowl of rice and a chopstick to either side of the bowl. The rules for dining:
Each philosopher thinks for a while, eats for a while, and then waits for a while
To eat, he must hold both his right and left chopstick
They only communicate by lifting and lowering their chopsticks

47. Trivia - Edsger Dijkstra
Dining Philosophers
In order to eat, the following algorithm must be utilized:
Pick up the right chopstick when available (wait if right neighbor has it)
Pick up the left chopstick when available (wait if left neighbor has it)
Eat
Using this algorithm, a few scenarios can occur leading to certain situations

48. Trivia - Edsger Dijkstra
Dining Philosophers
Deadlock occurs when all philosophers decide to eat at the same time, they succeed at the first step, but wait forever at the second
Starvation can occur for other philosophers if one philosopher never releases his chopsticks
Even if all eat, some may eat more than others which can cause “lack of fairness”

49. Alan Kay
“All understanding begins with our not accepting the world as it appears.”

50. Biography - Alan Kay
1966 – B.S. in Mathematics and Molecular Biology, University of Colorado
1969 – M.S. in Electrical Engineering, Ph.D. in Computer Science, University of Utah
1970 – Professor, Stanford Artificial Intelligence Laboratory
1972 – Group Leader, Xerox Palo Alto Research Center
1984 – Apple Fellow, Apple Computers

51. Achievements - Alan Kay
Designer of Smalltalk
Coined the term “object-orientation”
Conceived the laptop computer
Architect of the modern windowing GUI
2001 – UdK 01-Award winner
2003 – Turing Award winner
2004 – Kyoto Prize and Charles Stark Draper Prize winner

52. Trivia - Alan Kay Could read by the age of three
Expelled from Bethany College for protesting the Jewish quota
Made a living as a professional guitarist in the 1960s
Used his degree in molecular biology to help form the basic ideas of OOP
Very interested in using computers to further education

53. Donald Knuth
“Computer programming is an art form, like the creation of poetry or music.”

54. Biography - Donald Knuth
In 8th grade, won competition by composing words from “Ziegler’s Giant Bar”; Knuth found 4,500 in two weeks of feigning illness, the judge’s master list had 2,500, has said he would have found more if he had thought to use the apostrophe
Graduated from high school in 1956 with the highest GPA ever achieved at that school

55. Biography - Donald Knuth
Graduated in 1960 from Case Institute of Technology with a B.S. in Mathematics, was simultaneously awarded an M.S. for his achievements, an unprecedented move
Received a Ph.D. in Mathematics from California Institute of Technology in 1963
Joined Stanford University as a Professor of Computer Science in 1968
In 1993, became Professor Emeritus of The Art of Computer Programming at Stanford, where he is still currently located

56. Achievements - Donald Knuth
Authored The Art of Computer Programming, a multi-volume tome on CS
Inventor of TeX and METAFONT
LR(k) parsing
Knuth-Morris-Pratt algorithm
1974 – Turing Award winner
1979 – National Medal of Science
1995 – John von Neumann Medal

57. Trivia - Donald Knuth
The Art of Computer Programming began as a text about compilers
Loves organ music, mostly 4 and 8-hand music which he plays on an organ in his home, he studied piano as a child
Pays $2.56 (one hexadecimal dollar) for errors found in his books
Quit using in 1990
Processes all communications in batch-mode

58. Leslie Lamport
“A distributed system is one in which the failure of a computer you didn’t even know existed can render your own computer unusable.”

59. Biography - Leslie Lamport
1960 – B.S. in mathematics, Massachusetts Institute of Technology
1963 – M.A., Brandeis University
1972 – Ph.D., Brandeis University
– Massachusetts Computer Associates
– SRI International
– Digital Equipment Corporation/Compaq
2001-Present – Works for Microsoft

60. Achievements - Leslie Lamport
Bakery Algorithm – an improvement to Djikstra’s semaphore idea, which involves each participant getting a ticket
Lamport Clocks – A relative time idea used in distributed computing
Developed a technique using digital signatures to aid in fault-tolerant systems
Designer/developer of LaTeX, a macro system that sits on top of Knuth’s TeX and is used by many scientists for papers

61. Trivia - Leslie Lamport
LaTeX started as a side project to improve the “new version” of TeX introduced in 1982, Lamport estimates he spent about 10 months developing LaTeX
Very modest about his involvement with many of his ideas, saying “most of it seems like dumb luck—I happened to be looking at the right problem, at the right time, having the right background.”

62. John McCarthy
“If you want the computer to have general intelligence, the outer structure has to be commonsense knowledge and reasoning.”

63. Biography - John McCarthy
1948 – B.S. in Mathematics from the California Institute of Technology
1951 – Ph.D. in Mathematics from Princeton
Short-term appointments at Princeton, Stanford, Dartmouth, and MIT
1962 – Full Professor at Stanford University
Retired at the end of 2000, is now Professor Emeritus

64. Achievements - John McCarthy
Coined the term “artificial intelligence” in 1955 at the Dartmouth Conference
Designer of LISP, the principle language of artificial intelligence
1961 – First to propose publicly the selling of computing as a utility, like electricity or water
1962 – Set up the Stanford AI Laboratory
1971 – Turing Award winner

65. Trivia - John McCarthy
As a high school junior, bought the calculus books used for freshman and sophomore math, worked out all the exercises which allowed him to skip the first two years of math when he attended the school in 1944
Like Backus and Kay, eventually lost control over the language (LISP) he invented

66. John McCarthy LISP – list processing language
All lists are contained within parentheses (A B C), with the elements as atoms
Supports recursion and has an eval operation to define new functions and execute them as part of that program
CAR returns the first element of the list, (CAR ‘(A B C)) returns A
CDR returns a list with everything but the first element, (CDR ‘(A B C)) returns (B C)

67. Conclusions
This is only a small sampling of people who have contributed greatly to the field of computer science. We would like to thank the many others who haven’t been recognized, but have given greatly to our pool of knowledge. The future is bright, there are many active fields of research, and we look forward to acknowledging other pioneers in computer science.

68. References
“Computer Science: Prof Cook.” Cook, Stephen. November 2005 <
Dewdney, A.K. The New Turing Omnibus. New York: Henry Holt and Company, 1989.
“Don Knuth’s Home Page.” Knuth, Donald. November 2005 <
Knuth, Donald. The Art of Computer Programming. United States of America: Addison-Wesley Pub Co, 1997.
Knuth, D. E. and Bendix, P. B. "Simple Word Problems in Universal Algebra." In Computational Problems in Abstract Algebra (Proc. Conf., Oxford, 1967). Pergamon Press, pp , 1970.
Shasha, Dennis Elliott. Out of their minds: the lives and discoveries of 15 great computer scientists. New York: Copernicus, 1995.
Winston, Patrick Henry. LISP. Reading: Addison-Wesley Publishing Company, 1984.
Multiple Articles, November 2005 <