Computer game bot Turing Test change. When the tournament ended, no bot was rated as more human than any player. In subsequent tournaments, run during 2009–2011, bots achieved scores that were increasingly human-like, but no contestant had won the BotPrize in any of these contests. In 2012, the annual 2K BotPrize was held once again, and two teams programmed bots that achieved scores greater than those of human players. To date, there have been two successfully programmed bots that passed the Computer Game Bot Turing Test: Comments from the winners can be found in detail at the BotPrize website. These victors succeeded in the year
Non-deterministic Turing machine Non-deterministic Turing machine In theoretical computer science, a Turing machine is a theoretical machine that is used in thought experiments to examine the abilities and limitations of computers. In essence, a Turing machine is imagined to be a simple computer that reads and writes symbols one at a time on an endless tape by strictly following a set of rules. It determines what action it should perform next according to its internal "state" and "what symbol it currently sees". An example of one of a Turing Machine's rules might thus be: "If you are in state 2 and you see