Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematician

Norman Shapiro

Modern

Norman Zalmon Shapiro was an American mathematician and computer scientist, born in 1932, who co-authored the Rice-Shapiro theorem in computability theory. He took a bachelor degree at the University of Illinois in 1952 and a Ph.D. at Princeton in 1955 under Alonzo Church, and in that year coined the phrase strong reducibility for what is now called many-one reduction. In the summer of 1954 at Bell Laboratories he worked with Karel de Leeuw, Edward Moore and Claude Shannon on whether a random oracle lets a Turing machine compute noncomputable sequences. He was a leading mathematician and computer scientist at the RAND Corporation from 1959 to 1999, led early computer mapping work, and co-designed the MH message handling system.

Facts
Biography
Gender
Male 1
Birth Year
1932 1
Connections

In Branch

Source Norman Shapiro (Wikipedia)

Mentored By

Source Norman Shapiro (Wikipedia)

Principal Result

Source Norman Shapiro (Wikipedia)

Proofs Credited

Source Norman Shapiro (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Source Norman Shapiro (Wikipedia)Lead sentence
Quote, Lead sentence
was an American mathematician
Sources
1. Norman Shapiro (Wikipedia)
  • Pronouns in the article text
    Shapiro obtained his Ph.D. from Princeton University
  • Lead sentence, dates
    January 28, 1932
  • Lead sentence
    was an American mathematician
  • Mentored By: Alonzo Church, Education
    under the advisership of Alonzo Church
  • In Branch: Computability Theory, Education, doctoral thesis
    His thesis was titled Degrees of Computability
View the Source

Take a Related Quiz

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.