Hartley Rogers Jr. (July 6, 1926 – July 17, 2015) was an American mathematician who worked in computability theory, and was a professor in the Mathematics Department of the Massachusetts Institute of Technology.
Born in 1926 in Buffalo, New York, Rogers studied English as an undergraduate at Yale University, graduating in 1946. After visiting the University of Cambridge under a Henry Fellowship, he returned to Yale for a master's degree in physics, which he completed in 1950. He studied mathematics under Alonzo Church at Princeton, earned a second master's degree in 1951, and received his Ph.D. there in 1952.
He was a Benjamin Peirce Lecturer at Harvard University from 1952 to 1955. After holding a visiting position at MIT, he became a professor in the MIT Mathematics Department in 1956. His doctoral students included Patrick Fischer, Louis Hodes, Carl Jockusch, Andrew Kahr, David Luckham, Rohit Parikh, David Park, and John Stillwell. He chaired the MIT faculty senate from 1971 to 1973 and served as associate provost of the university from 1974 to 1980.
Beyond teaching and research, Rogers was an avid rower and rowing competitor.
He retired as a professor emeritus in 2009, and died on July 17, 2015.[1]
Rogers worked in mathematical logic, particularly recursion theory, and wrote the classic text Theory of Recursive Functions and Effective Computability.[2] The Rogers equivalence theorem is named after him.
Rogers won the Lester R. Ford Award in 1965 for his expository article Information Theory.[3]