Seinosuke Toda

{{Short description|Japanese computer scientist}}

{{nihongo|Seinosuke Toda|戸田 誠之助|Toda Seinosuke|extra=born January 15, 1959}} is a computer scientist working at the Nihon University in Tokyo.[http://tdweb.cssa.chs.nihon-u.ac.jp S. Toda] {{webarchive|url=https://web.archive.org/web/20070818060047/http://tdweb.cssa.chs.nihon-u.ac.jp/ |date=2007-08-18 }} at the Nihon University. Toda earned his Ph.D. from the Tokyo Institute of Technology in 1992, under the supervision of Kojiro Kobayashi.{{MathGenealogy|id=108320}} He was a recipient of the 1998 Gödel Prize for proving Toda's theorem in computational complexity theory, which states that every problem in the polynomial hierarchy has a polynomial-time Turing reduction to a counting problem.{{cite web |url=http://www.sigact.org/Prizes/godel/1998.html |title=1998 Gödel Prize |publisher=www.sigact.org |accessdate=2010-12-05 }}