About Richard hamming

1. Academic Writing
Subjective assignment II
VISHNUPRABHA R M
Student ID: fd5ac454ecd411e9ac2e3db2647717a7
SASTRA Deemed to be University
1

2. ACKNOWLEDGEMENT
I extend my gratitude towards ACADEMIC
WRITING COURSE from which I learnt to
write a research article as well as review
article without plagiarism.
2

3. Richard Hamming
About
3

4. ABOUT
 Richard Wesley Hamming
 Born - Feb 11,1915
Chicago, Illinois U.S.
 Died – Jan 7,1998(aged 82)
Monterey, California,
U.S.
4

5. BEST KNOWN FOR
 Hamming code
 Hamming window
 Hamming numbers
 Hamming distance
 Association for Computing Machinery
5

6. EDUCATION
 B.S. - University of Chicago (1937)
- mathematics
 M.A. - University of Nebraska (1939)
 Ph.D. - University of Illinois at Urbana
Champaign (1942)
- Some Problems in the Boundary Value Theory of Linear
Differential Equations under Waldemar Trjitzinsky
6

7. 1944-1945
 Asst Prof - J. B. Speed Scientific School,
University of Louisville, Louisville, Kentucky
(1944)
 During world war 2 Hamming left Louisville in April
1945.
 Work on Manhattan Project, Los Alamos Laboratory, in
Hans Bethe's division.
7

8. Manhattan Project
 Programming the IBM calculating machines that
computed the solution to equations provided by the
project's physicists.
 Hamming remained at Los Alamos until 1946,
when he accepted a post at the Bell Telephone
Laboratories (BTL).
8

9. Bell Laboratories
At the Bell Labs Hamming shared an office
for a time with Claude Shannon
He hired to work on elasticity theory.
He spent time with the calculating
machines.
9

10. PARITY BITS
 Digital machines manipulated information as
sequences of 0’s and 1’s, as “bits”.
 If a single bit in a sequence was wrong, then the
whole sequence would be.
 To detect this, a parity bit was used to verify the
correctness of each sequence.
10

11. Hamming distance
 "If the computer can tell when an error has occurred”
 Hamming reasoned
-"surely there is a way of telling where the error is so that the
computer can correct the error itself.”
 He introduced a concept of the number of positions differ.
 How many changes are required to transform one code word into
another - known as the Hamming distance
 He created error correcting code called Hamming code
11

12. HAMMING WINDOW
 Hamming developed an improved version, the
Hamming predictor-corrector
 He did extensive research into digital filters, devising a
new filter - the Hamming window
 With Ruth A. Weiss he developed the L2 programming
language in 1950s
12

13. Hamming numbers
 Edsger Dijkstra attributed to Hamming the problem of efficiently
finding regular numbers
 The problem became known as "Hamming's problem”
 Regular numbers are often referred to as Hamming numbers
13

14. Later life
 1958 to 1960 - President of the Association for Computing
Machinery
 1960 to 1976 - Professorships at Stanford University,
Stevens Institute of Technology,
the City College of New York,
the University of California at Irvine and
Princeton University
 1976 - Moved Naval Postgraduate School in California,
as an Adjunct Professor and senior lecturer
in computer science.
 1997 - Professor Emeritus in June
delivered his last lecture in Dec
14

15. Awards
 Turing Award, Association for Computing Machinery, 1968.
 Member of the National Academy of Engineering, 1980.
 Harold Pender Award, University of Pennsylvania, 1981.
 Fellow of the Association for Computing Machinery, 1994.
 Basic Research Award, Eduard Rhein Foundation, 1996.
15

16. THANK YOU
REFERENCE
Google search(https://en.wikipedia.org/wiki/Richard_Hamming)
16