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
Turing degree same level of unsolvability; each Turing degree is a collection of Turing equivalent sets, so that two sets are in different Turing degrees exactly when they are not Turing equivalent. Furthermore, the Turing degrees are partially ordered so that if the Turing degree of a set "X" is less than the Turing degree of a set "Y" then any (noncomputable) procedure that correctly decides whether numbers are in "Y" can be effectively converted to a procedure that correctly decides whether numbers are in "X". It is in this sense that the Turing degree of a set corresponds to its level