Norman Shapiro
   HOME

TheInfoList



OR:

Norman Zalmon Shapiro was an American
mathematician A mathematician is someone who uses an extensive knowledge of mathematics in their work, typically to solve mathematical problems. Mathematicians are concerned with numbers, data, quantity, structure, space, models, and change. History On ...
, who was the co-author of the
Rice–Shapiro theorem In computability theory, the Rice–Shapiro theorem is a generalization of Rice's theorem, and is named after Henry Gordon Rice and Norman Shapiro Norman Zalmon Shapiro was an American mathematician, who was the co-author of the Rice–Shapiro t ...
.


Education

Shapiro obtained a BS in Mathematics at University of Illinois in 1952. Shapiro spent the summer of 1954 at
Bell Laboratories Nokia Bell Labs, originally named Bell Telephone Laboratories (1925–1984), then AT&T Bell Laboratories (1984–1996) and Bell Labs Innovations (1996–2007), is an American industrial Research and development, research and scientific developm ...
in Murray Hill, New Jersey where, in collaboration with Karel de Leeuw, Ed Moore, and
Claude Shannon Claude Elwood Shannon (April 30, 1916 – February 24, 2001) was an American mathematician, electrical engineer, and cryptographer known as a "father of information theory". As a 21-year-old master's degree student at the Massachusetts I ...
, he investigated the question of whether providing a
Turing machine A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, it is capable of implementing any computer alg ...
augmented with an
oracle machine In complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems. It can be visualized as a Turing machine with a black box, called an oracle, which is able to solve certain problems in a ...
producing an infinite sequence of random events (like the tosses of a fair coin) would enable the machine to output a non-computable sequence. The well-known efficacy of
Monte Carlo method Monte Carlo methods, or Monte Carlo experiments, are a broad class of computational algorithms that rely on repeated random sampling to obtain numerical results. The underlying concept is to use randomness to solve problems that might be deter ...
s might have led one to think otherwise, but the result was negative. Stated precisely: : An infinite string, S, on a finite alphabet is
computable Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within mathematical logic and the theory of computation within computer science. The computability of a problem is clos ...
if it can be output with probability one by a
Turing machine A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, it is capable of implementing any computer alg ...
augmented by an
oracle machine In complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems. It can be visualized as a Turing machine with a black box, called an oracle, which is able to solve certain problems in a ...
giving an infinite sequence of equal-probability zeroes and ones. Moreover, the result continues to hold if the output probability is any positive number, and the probability of an oracle machine inquiry yielding 1 is any computable real number. Shapiro obtained his Ph.D from
Princeton University Princeton University is a private research university in Princeton, New Jersey. Founded in 1746 in Elizabeth as the College of New Jersey, Princeton is the fourth-oldest institution of higher education in the United States and one of the ...
in 1955 under the advisership of
Alonzo Church Alonzo Church (June 14, 1903 – August 11, 1995) was an American mathematician, computer scientist, logician, philosopher, professor and editor who made major contributions to mathematical logic and the foundations of theoretical computer scien ...
. In 1955, as a Princeton PhD student, Shapiro coined the phrase "strong reducibility" for a computability theory currently called the
many-one reduction In computability theory and computational complexity theory, a many-one reduction (also called mapping reduction) is a reduction which converts instances of one decision problem L_1 into instances of a second decision problem L_2 where the inst ...
. His thesis was titled ''Degrees of Computability'' and was published in 1958.


Career

Shapiro was a leading mathematician and
computer scientist A computer scientist is a person who is trained in the academic study of computer science. Computer scientists typically work on the theoretical side of computation, as opposed to the hardware side on which computer engineers mainly focus (a ...
at the
RAND Corporation The RAND Corporation (from the phrase "research and development") is an American nonprofit global policy think tank created in 1948 by Douglas Aircraft Company to offer research and analysis to the United States Armed Forces. It is finance ...
think tank from 1959 until 1999. In the late 1960s and early 1970s Shapiro was the lead designer of one of the first computer-based mapping and cartography systems. In the 1970s Shapiro co-designed the
MH Message Handling System The MH Message Handling System is a free, open source e-mail client. It is different from almost all other mail reading systems in that, instead of a single program, it is made from several different programs which are designed to work from the co ...
. MH was the first mail system to utilize
Unix Unix (; trademarked as UNIX) is a family of multitasking, multiuser computer operating systems that derive from the original AT&T Unix, whose development started in 1969 at the Bell Labs research center by Ken Thompson, Dennis Ritchie, ...
design principles by using shell commands to manipulate messages as individual files. In 1972, Norman Z. Shapiro was a creative lead in his essays on e-mail etiquette, introducing concepts that were rarely considered until over 15 years later. His work may be the first substantial writing about
netiquette Etiquette in technology, colloquially referred to as netiquette is a term used to refer to the unofficial code of policies that encourage good behavior on the Internet which is used to regulate respect and polite behavior on social media platforms ...
. The primary essay was "Toward an Ethics and Etiquette for Electronic Mail". In the 1970s through 1990s Shapiro developed many new and unique contributions to computer science, mathematics, and modeling. In the early 1980s, he was the software architect for large and complex game-structured simulation (the RAND Strategy Assessment System) at the RAND Corporation. That represented regional or global crisis and war with agents optionally substituting for human teams in making high-level decisions. These decisions then directed actions represented in a large global combat model. Different versions of the agents could be substituted (e.g., to reflect a change in government). Agents could run the simulation within itself to test potential strategies with "lookahead." The system was successfully implemented Davis, Paul K. and H. Edward Hall, "Overview of RSAS System Software." Santa Monica, CA: RAND Corporation, 1988. https://www.rand.org/content/dam/rand/pubs/notes/2009/N2755.pdf. and was used in the late 1980s before the end of the Cold War. As part of the subsequent development, Shaprio co-invented (with H. Edward Hall) a new programming language called Abel (later called RAND-ABEL). This was not the first A.I. style simulation language to look and read like English, but it was clearer and more readable by non-programmers than its predecessors. The main innovation of ABEL was the execution as code of tables that read to the human like any normal table one would find in a magazine article or essay. The ABEL compiler uses these "English" tables in multiple ways: as data values, as a decision tree, or as a complex conditional and value setting function. This was the first time natural language tables have been machine-executed in this manner. Shapiro wrote extensively on
databases In computing, a database is an organized collection of data stored and accessed electronically. Small databases can be stored on a file system, while large databases are hosted on computer clusters or cloud storage. The design of databases spa ...
and
privacy Privacy (, ) is the ability of an individual or group to seclude themselves or information about themselves, and thereby express themselves selectively. The domain of privacy partially overlaps with security, which can include the concepts of ...
, the effects of automation on the court system, the future of automation, and on topics in mathematics, chemistry, and biology. Much of his work is available as full text PDFs at no charge from the publisher,
RAND Corporation The RAND Corporation (from the phrase "research and development") is an American nonprofit global policy think tank created in 1948 by Douglas Aircraft Company to offer research and analysis to the United States Armed Forces. It is finance ...
.


References


External links


List of Norman Z Shapiro's 50 RAND publications





Norman Z Shapiro's listing in Microsoft's database of Academic Authors
{{DEFAULTSORT:Shapiro, Norman 1932 births 2021 deaths 20th-century American mathematicians 21st-century American mathematicians American logicians University of Illinois alumni Princeton University alumni