Grigori Samuilovitsch Tseitin (Russian: Григорий Самуилович Цейтин, born November 15, 1936 in Leningrad, USSR, deceased August 27, 2022 in Campbell, CA, USA) was a Russian mathematician and computer scientist, who moved to the United States in 1999. He is best known for Tseitin transformation used in SAT solvers, Tseitin tautologies used in the proof complexity theory, and for his work on Algol 68.[1]

Biography

Tseitin studied Mathematics at the Leningrad State University (now Saint Petersburg State University) in 1951-1956. He earned his PhD in 1960 with "Algorithmic Operators on Constructive Complete Separable Metric Spaces“.[2] In 1968, he received the Russian doctoral degree (corresponding to a habilitation) from the same university . From 1960 to 2000 Tseitin worked at the Smirnov Scientific Research Institute of Mathematics and Mechanics[3] and taught classes in computer science at his alma mater.

In 2006, Tseitin was recognized as a Distinguished Scientist by the ACM.[4]

Works

  • G. S. Tseitin. „On the complexity of derivation in propositional calculus“ in: J. Siekmann and G. Wrightson, editors, Automation of Reasoning 2: Classical Papers on Computational Logic 1967–1970, S. 466–483. Berlin, Heidelberg, 1983.

References

  1. ↑ A. van Wijngaarden, B.J. Mailloux, J.E.L. Peck, C.H.A. Koster, M. Sintzoff, C.H. Lindsey, L.G.T. Meertens, R.G.Fisker (1970). "Revised Report on the Algorithmic Language ALGOL 68" (PDF; 4,42 MB). softwarepreservation.org. Retrieved 2018-12-25.{{cite web}}: CS1 maint: multiple names: authors list (link)
  2. ↑ Grigori Tseitin at the Mathematics Genealogy Project
  3. ↑ "St Petersburg State University / Mathematic-Mechanical Faculty / Smirnov Scientific Research Institute of Mathematics and Mechanics". Istc.int. Retrieved 2018-12-25.
  4. ↑ "Dr. Gregory S Tseytin". awards.acm.org. Retrieved 2018-12-25.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.