Biography:Boris Trakhtenbrot
Boris Trakhtenbrot | |
---|---|
1994 | |
Born | Brichevo, Bessarabia |
Died | 19 September 2016 Rehovot, Israel | (aged 95)
Spouse(s) | Berta I. Rabinovich (m. 1947; died 2013) |
Academic background | |
Alma mater | Ukrainian Academy of Science |
Thesis | Decidability Problems for Finite Classes and Definitions of Finite Sets (1950) |
Doctoral advisor | Pyotr Novikov |
Academic work | |
Institutions |
Boris (Boaz) Abramovich Trakhtenbrot (Russian: Борис Авраамович Трахтенброт, Hebrew: בועז טרכטנברוט; 19 February 1921 – 19 September 2016) was a Russian-Israeli mathematician in logic, algorithms, theory of computation, and cybernetics.
Biography
Trakhtenbrot was born into a Jewish family in Brichevo, northern Bessarabia (now Tîrnova, Moldova).[1] He studied at the Moldovan State Pedagogical Institute in Kishinev, Chernivtsi University, and the Ukrainian Academy of Science's Mathematical Institute, completing a Ph.D. at the latter institution in 1950.[2]
He worked at Akademgorodok, Novosibirsk during the 1960s and 1970s.[3][4] In 1964 Trakhtenbrot discovered and proved a fundamental result in theoretical computer science called the gap theorem.[5] He also discovered and proved the theorem in logic, model theory, and computability theory now known as Trakhtenbrot's theorem.[6]
After immigrating to Israel in 1981, he became a professor in the Faculty of Exact Sciences at Tel Aviv University, and continued as professor emeritus until his death. He died on 19 September 2016, at the age of 95.[2][7]
Notes
- ↑ "Surnames starting with the letter T". Russian Jewish Encyclopedia. Moscow. 1995. http://jewishgen.org/belarus/rje_t.htm.
- ↑ 2.0 2.1 "Boaz (Boris) Trakhtenbrot, 1921–2016". Tel Aviv University. https://exact-sciences.tau.ac.il/computer-h/100_Boaz_Trakhtenbrot.
- ↑ "Error: no
|title=
specified when using {{Cite web}}" (in ru). http://www.ershov.ras.ru/archive/eaman.asp?pplid=1758&?lang=2. - ↑ "History of Computing in Russia" (in ru). http://cshistory.nsu.ru/obj1181/INTERFACE.htm.
- ↑ Boris Trakhtenbrot (1964). "Turing computations with logarithmic delay" (in ru). Algebra and Logic 3 (4): 33–48.
- ↑ Boris Trakhtenbrot (1950). "The Impossibility of an Algorithm for the Decidability Problem on Finite Classes" (in ru). Proceedings of the USSR Academy of Sciences 70 (4): 569–572.
- ↑ Fisher, Lawrence M. (21 September 2016). "In Memoriam: Boris Trakhtenbrot, 1921-2016". Association for Computing Machinery. http://cacm.acm.org/news/207650-in-memoriam-boris-trakhtenbrot-1921–2016/fulltext.
External links
- {{DBLP}} template missing ID and not present in Wikidata.
- Pillars of Computer Science Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday]. Lecture Notes in Computer Science. 4800. Springer. 2008. http://dblp.uni-trier.de/db/conf/birthday/trakhtenbrot2008.html.
Original source: https://en.wikipedia.org/wiki/Boris Trakhtenbrot.
Read more |