Jump to content

John G. Kemeny

From Wikipedia, the free encyclopedia
(Redirected from J. Kemeny)
John G. Kemeny
13th President of Dartmouth College
In office
1970–1981
Preceded byJohn Sloan Dickey
Succeeded byDavid T. McLaughlin
Personal details
Born(1926-05-31)May 31, 1926
Budapest, Kingdom of Hungary
DiedDecember 26, 1992(1992-12-26) (aged 66)
Hanover, New Hampshire, United States
EducationPrinceton University (A.B., Ph.D.)
AwardsComputer Pioneer Award (1985)

John George Kemeny (born Kemény János György; May 31, 1926[1] – December 26, 1992) was a Hungarian-born American mathematician, computer scientist, and educator best known for co-developing[2] the BASIC programming language in 1964 with Thomas E. Kurtz. Kemeny served as the 13th President of Dartmouth College from 1970 to 1981 and pioneered the use of computers in college education. Kemeny chaired the presidential commission that investigated the Three Mile Island accident in 1979.[2] According to György Marx he was one of The Martians.[3]

Early life

[edit]

Born in Budapest, Hungary, into a Jewish family,[1] Kemeny attended the Rácz private primary school in Budapest and was a classmate of Nándor Balázs. In 1938 his father left for the United States alone. In 1940, he took the whole Kemeny family to the United States[1] when the adoption of the second anti-Jewish law in Hungary became imminent.[4] His grandfather, however, refused to leave and was killed in the Holocaust, along with an aunt and uncle.[5] Kemeny's family settled in New York City where he attended George Washington High School. He graduated with the best results in his class three years later.[2] In 1943,[1] Kemeny entered Princeton University where he studied mathematics and philosophy, but he took a year off during his studies to work on the Manhattan Project at Los Alamos National Laboratory, where his boss was Richard Feynman. He also worked there with John von Neumann. Returning to Princeton, Kemeny graduated with an A.B. in mathematics in 1946 after completing a senior thesis, titled "Equivalent logical systems", under the supervision of Alonzo Church.[6] He then remained at Princeton to pursue graduate studies and received a Ph.D. in mathematics in 1949 after completing a doctoral dissertation, titled "Type-theory vs. set-theory", also under the supervision of Alonzo Church.[7][2]

He worked as Albert Einstein's mathematical assistant during graduate school.[1] J. Laurie Snell writes the following about Einstein's advice to Kemeny and seeing him drawn to the United World Federalists (UWF) Movement:[8]

"John was tempted to devote a major part of his time to this program. Einstein told him that he should first make his mark on the world, for then people would listen to him. We have all been rewarded by Kemeny's decision to heed Einstein's advice."

United World Federalists was the movement through which he met his future wife, then-Smith student Jean Alexander.[8]

Career

[edit]

Kemeny was appointed to the Dartmouth Mathematics Department as a full professor in 1953, at the age of 27.[1] Two years later he became chairman of the department, and held this post until 1967. Kemeny ventured into curriculum development when he introduced Finite mathematics courses. He teamed with Gerald L. Thompson and J. Laurie Snell to write Introduction to Finite Mathematics (1957) for students of biology and social sciences. The Dartmouth mathematics department professors also wrote Finite Mathematical Structures (1959) and Finite Mathematics with Business Applications (1962). Other colleges and universities followed this lead and several more textbooks in Finite Mathematics were composed elsewhere. The topic of Markov chains was particularly popular so Kemeny teamed with J. Laurie Snell to publish Finite Markov Chains (1960) to provide an introductory college textbook. Considering the advances using potential theory obtained by G. A. Hunt, they wrote Denumerable Markov Chains in 1966.[9] This textbook, suitable for advanced seminars,[10] was followed by a second edition in 1976 when an additional chapter on random fields by David Griffeath was included.

Kemeny and Kurtz were pioneers in the use of computers for ordinary people. After early experiments with ALGOL 30 and DOPE on the LGP-30, they invented the BASIC programming language in 1964, as well as one of the world's first time-sharing systems, the Dartmouth Time-Sharing System (DTSS). In 1974, the American Federation of Information Processing Societies gave an award to Kemeny and Kurtz at the National Computer Conference for their work on BASIC and time-sharing.[11] BASIC was the language used in most software written during the rise of the Apple II, the Commodore, the TRS-80, and the IBM PCs throughout the 80s, and its successor on PCs, Visual Basic (.NET), is still in use in 2023.[12] In 1980s, Sinclair BASIC was also essential for Sinclair ZX family of computers.[13]

Kemeny was president of Dartmouth from 1970 to 1981, and continued to teach undergraduate courses and to do research and publish papers during his time as president. He presided over the coeducation of Dartmouth in 1972. He also instituted the "Dartmouth Plan" of year-round operations, thereby allowing more students without more buildings. During his administration, Dartmouth became more proactive in recruiting and retaining minority students[2] and revived its founding commitment to provide education for American Indians. Kemeny made Dartmouth a pioneer in student use of computers, equating computer literacy with reading literacy. In 1982 he returned to teaching full-time.

In 1983, Kemeny and Kurtz co-founded a company called True BASIC, Inc. to market True BASIC, an updated version of the language.

Death

[edit]
Commemorative plaque to John George Kemeny. It is affixed to the wall of his former domicile.

John Kemeny died at the age of 66, the result of heart failure in Lebanon, New Hampshire[2] on December 26, 1992.[4] He had lived in Etna, near the Dartmouth Campus.

See also

[edit]

References

[edit]
  1. ^ a b c d e f Weibel, Peter (2005). Beyond Art - A Third Culture : a Comparative Study in Cultures, Art, and Science in 20th Century Austria and Hungary. Springer. p. 350. ISBN 3-211-24562-6.
  2. ^ a b c d e f Faison, Seth (1992-12-27). "John Kemeny, 66, Computer Pioneer and Educator (obituary)". The New York Times. Retrieved 2008-02-02.
  3. ^ A marslakók legendája Archived 2022-04-09 at the Wayback Machine - György Marx
  4. ^ a b Ohles, Frederik; Shirley M. Ohles; John G. Ramsay (1997). Biographical Dictionary of Modern American Educators. Greenwood Publishing Group. pp. 189. ISBN 0-313-29133-0.
  5. ^ "True Basic. A sketch of John Kemeny" (PDF). Dartmouth Alumni Magazine. 2001-12-13. Retrieved 2012-07-23.
  6. ^ Kemeny, John G. (1946). Equivalent logical systems. Princeton, NJ: Department of Mathematics.
  7. ^ Kemeny, John George (1949). Type-theory vs. set-theory.
  8. ^ a b "John Kemeny". math.dartmouth.edu. Retrieved 2023-08-24.
  9. ^ J. L. Doob (1966) Review: Denumerable Markov Chains, MR0207042
  10. ^ Preface, page vi
  11. ^ "TRANSCRIPTS OF 1974 National Computer Conference Pioneer Day Session". Dartmouth Time Sharing System. Dartmouth College. 1974.
  12. ^ KathleenDollard (February 6, 2023). "Visual Basic language strategy - Visual Basic". learn.microsoft.com. Archived from the original on March 31, 2023. Retrieved 2023-03-31.
  13. ^ Smith, Tony (23 April 2012). "Happy 30th Birthday, Sinclair ZX Spectrum". The Register.
[edit]
Retrieved from "https://wiki.riteme.site/w/index.php?title=John_G._Kemeny&oldid=1259841440"