Seinosuke Toda

Seinosuke Toda (戸田 誠之助, Toda Seinosuke, born January 15, 1959) is a computer scientist working at the Nihon University in Tokyo.[1] Toda earned his Ph.D. from the Tokyo Institute of Technology in 1992, under the supervision of Kojiro Kobayashi.[2] 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.[3]

Notes
  1. S. Toda Archived 2007-08-18 at the Wayback Machine at the Nihon University.
  2. Seinosuke Toda at the Mathematics Genealogy Project
  3. "1998 Gödel Prize". www.sigact.org. Retrieved 2010-12-05.


gollark: What you can do is compile to bytecode or minify it.
gollark: The fundamental issue is that the computer has to have/generate some runnable form of the code at some point in order to, well, run it.
gollark: <@!209142270195138560> SKyCrafter0 is wrong and you cannot just encrypt it to protect it, since the computer must obviously store the encryption key.
gollark: <@331644985378078720> Obfuscate yes, entirely protect no.
gollark: Please don't.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.