Juris Hartmanis

From Wikipedia, the free encyclopedia

Juris Hartmanis

Born July 7, 1928 (1928-07-07) (age 79)
Riga, Latvia
Fields Computer Science
Institutions General Electric
Cornell University
Notable awards Turing Award

Juris Varlejs Hartmanis (born July 7, 1928 in Riga, Latvia) is a prominent computer scientist and computational theorist who, with Richard E. Stearns, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory".

Hartmanis was born in Latvia. He was a son of Martins Hermanis, a general in the Latvian Army. After the Soviet Union occupied Latvia in 1940, Martins Hermanis was arrested by Soviets and died in a prison. At the end of World War II, the wife and children of Martins Hermanis left Latvia as refugees, fearing for their safety if the Soviet Union took over Latvia again.

They first moved to Germany, where Juris Hartmanis received the equivalent of a Bachelor's degree in Physics from the University of Marburg. Then he moved to the United States, where he received Master's degree in Applied Mathematics at the University of Kansas City (now known as the University of Missouri-Kansas City) in 1951 and Ph.D. in Mathematics from Caltech under the supervision of Robert P. Dilworth in 1955.

After teaching at Cornell University and Ohio State University, Hartmanis joined the General Electric Research Laboratory in 1958. While at General Electric, he developed the principles of computer science. In 1965, he became a professor at Cornell University. At Cornell, he was one of founders and the first chairman of its computer science department (which was one of first computer science departments in the world). Hartmanis is a Fellow of the Association for Computing Machinery and a member of National Academy of Engineering.

He is best known for his Turing-award winning paper with Richard Stearns, in which he introduced time complexity classes TIME (f(n)) and proved the time hierarchy theorem.

[edit] References

  • Hartmanis, J., and Stearns, R. E. On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117 (1965), 285--306.

[edit] External links

v • d • e
A. M. Turing Award laureates

Perlis (1966) · Wilkes (1967) · Hamming (1968) · Minsky (1969) · Wilkinson (1970) · McCarthy (1971) · Dijkstra (1972) · Bachman (1973) · Knuth (1974) · Newell / Simon (1975) · Rabin / Scott (1976) · Backus (1977) · Floyd (1978) · Iverson (1979) · Hoare (1980) · Codd (1981) · Cook (1982) · Thompson / Ritchie (1983) · Wirth (1984) · Karp (1985) · Hopcroft / Tarjan (1986) · Cocke (1987) · Sutherland (1988) · Kahan (1989) · Corbató (1990) · Milner (1991) · Lampson (1992) · Hartmanis / Stearns (1993) · Feigenbaum / Reddy (1994) · Blum (1995) · Pnueli (1996) · Engelbart (1997) · Gray (1998) · Brooks (1999) · Yao (2000) · Dahl / Nygaard (2001) · Rivest / Shamir / Adleman (2002) · Kay (2003) · Cerf / Kahn (2004) · Naur (2005) · Allen (2006) · Clarke / Emerson / Sifakis (2007)


Persondata
NAME Hartmanis, Juris
ALTERNATIVE NAMES
SHORT DESCRIPTION Computer scientist
DATE OF BIRTH July 7, 1928
PLACE OF BIRTH Riga, Latvia
DATE OF DEATH
PLACE OF DEATH