Hartley Rogers Jr.

Hartley Rogers Jr. (1926–2015) was a mathematician who worked in recursion theory, and was a professor in the Mathematics Department of the Massachusetts Institute of Technology. The Rogers equivalence theorem is named after him.

Biography

Born in 1926 in Buffalo, New York,[1] he studied under Alonzo Church at Princeton, and received his Ph.D. there in 1952. He served on the MIT faculty from 1956 until his death, July 17, 2015.[2]

There he had been involved in many scholarly extracurricular activities, including running SPUR (Summer Program in Undergraduate Research) for MIT undergraduates, overseeing the mathematics section of RSI (Research Science Institute) for advanced high school students, and coaching the MIT Putnam exam team for nearly two decades starting in 1990, including the years 2003 and 2004 when MIT won for the first time since 1979. He also ran a seminar called 18.S34: Mathematical Problem Solving for MIT freshmen.

Rogers is known within the MIT undergraduate community also for having developed a multivariable calculus course (18.022: Multivariable Calculus with Theory) with the explicit goal of providing a firm mathematical foundation for the study of physics. In 2005 he announced that he would no longer be teaching the course himself, but it is likely that it will continue to be taught in a similar manner in the future. He is remembered for his witty mathematical comments during lectures as well as his tradition of awarding Leibniz Cookies and Fig Newtons to top performers in his class. His doctoral students included Patrick Fischer, Louis Hodes, Carl Jockusch, Andrew Kahr, David Luckham, Rohit Parikh, David Park, and John Stillwell. Rogers won the Lester R. Ford Award in 1965 for his expository article Information Theory.[3]

In his spare time, he served for many years as the Chaplain for the World Indoor Rowing Championships as part of the C.R.A.S.H.-B. Sprints Board of Directors.

An avid oarsman, he was most recently a member of the Cambridge Boat Club on the Charles River, Cambridge, Massachusetts.

Selected works
  • "Recursive functions over well ordered partial orderings". Proc. Amer. Math. Soc. 10: 847–853. 1959. doi:10.1090/s0002-9939-1959-0111685-8. MR 0111685.
  • with Donald L. Kreider: "Constructive versions of ordinal number classes". Trans. Amer. Math. Soc. 100: 325–369. 1961. doi:10.1090/s0002-9947-1961-0151396-x. MR 0151396.
  • "On universal functions". Proc. Amer. Math. Soc. 16: 39–44. 1965. doi:10.1090/s0002-9939-1965-0171705-4. MR 0171705.
  • Hartley Rogers Jr., The Theory of Recursive Functions and Effective Computability, MIT Press, ISBN 0-262-68052-1 (paperback), ISBN 0-07-053522-1 (textbook)[4]
gollark: Why do you need to do this? Use. The. Standard. Library. Or. SOmething.
gollark: ```THE KNOWLEDGE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF UNLEASHING INDESCRIBABLE HORRORS THAT SHATTER YOUR PSYCHE AND SET YOUR MIND ADRIFT IN THE UNKNOWABLY INFINITE COSMOS.```
gollark: And mark that method as unsafe since *in its current form it is not safe*.
gollark: You should get someone to code-review it, though.
gollark: ```Instead of the programs I had hoped for, there came only a shuddering blackness and ineffable loneliness; and I saw at last a fearful truth which no one had ever dared to breathe before — the unwhisperable secret of secrets — The fact that this language of stone and stridor is not a sentient perpetuation of Rust as London is of Old London and Paris of Old Paris, but that it is in fact quite unsafe, its sprawling body imperfectly embalmed and infested with queer animate things which have nothing to do with it as it was in compilation.```

References
  1. Prof. Hartley Rogers Jr. at alumweb.mit.edu
  2. MIT mathematics faculty
  3. Rogers Jr., Hartley (1964). "Information Theory". Mathematics Magazine. 37: 63–78.
  4. Yates, C. E. M. (March 1971). "Review: Theory of recursive functions and effective computability, by Hartley Rogers Jr". J. Symb. Log. 36 (1): 141–146. doi:10.2307/2271523. JSTOR 2271523.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.