Researchers in neural machine translation (NMT) and natural language processing (NLP) may want to keep an eye on a new framework from Google. Lingvo is specifically tailored toward sequence models and NLP, which includes speech recognition, language understanding, MT, and speech translation. The Google AI team claims there are already "dozens" of research papers in these areas based on Lingvo. In fact, they said this was one reason they decided to open-source the project: to support the research community and encourage reproducible results. Lingvo supports multiple neural network architectures -- from recurrent neural nets to Transformer models -- and comes with lots of documentation on common implementations across different tasks (i.e., NLP, NMT, speech synthesis).

I believe it is likely that we will have 10,000 qubit quantum computers within 5 to 10 years. There is rapidly advancing work by IonQ with trapped ion quantum computers and a range of superconducting quantum computer systems by Google, IBM, Intel, Rigetti and 2000-5000 qubit quantum annealing computers by D-Wave Systems. They will be beyond not just any regular computer today but any non-quantum computer ever for those kinds of problems. Those quantum computers will help improve artificial intelligence systems. How certain is this development? What will it mean for humans and our world?

Samuel's successes included a victory by his program over a master-level player. In fact, the opponent was not a master, and Samuel himself had no illusions about his program's strength. This single event, a milestone in AI, was magnified out of proportion by the media and helped to create the impression that checkers was a solved game. Nevertheless, his work stands as a major achievement in machine learning and AI. Since 1950, the checkers world has been dominated by Tinsley.

This work remains a milestone in AI research. Samuel's program reportedly beat a master and "solved" the game of checkers. Both journalistic claims were false, but they created the impression that there was nothing of scientific interest left in the game (Samuel himself made no such claims). Consequently, most subsequent game-related research turned to chess. Other than a program from Duke University in the 1970s (Truscott 1979), little attention was paid to achieving a world championship-caliber checker program.

So, they sat in the now-defunct Computer Museum in Boston. The room was large, but the crowd numbered in the teens. The two men were slated to play 30 matches over the next two weeks. The year was 1994, before Garry Kasparov and Deep Blue or Lee Sedol and AlphaGo. Contemporary accounts played the story as a Man vs. Machine battle, the quick wits of a human versus the brute computing power of a supercomputer.

And now, after putting dozens of computers to work night and day for 18 years--jump, jump, jump--he says he has solved the game--king me!. "The starting position, assuming no side makes a mistake, is a draw," he says. Schaeffer's proof, described today in Science (and freely available here for others to verify), would make checkers the most complex game yet solved by machines, beating out the checker-stacking game Connect Four in difficulty by a factor of a million. "It's a milestone," says Murray Campbell, a computer scientist at IBM's T. J. Watson Research Center in Hawthorne, N.Y., and co-inventor of the chess program Deep Blue. "He's stretched the state of the art." Although technological limits prohibit analyzing each of the 500 billion billion possible arrangements that may appear on an eight-by-eight checkerboard, Schaeffer and his team identified moves that guaranteed the game would end in a draw no matter how tough the competition.

The ancient game of checkers (or draughts) has been pronounced dead. The game was killed by the publication of a mathematical proof showing that draughts always results in a draw when neither player makes a mistake. For computer-game aficionados, the game is now "solved". Draughts is merely the latest in a steady stream of games to have been solved using computers, following games such as Connect Four, which was solved more than 10 years ago. The computer proof took Jonathan Schaeffer, a computer-games expert at the University of Alberta in Canada, 18 years to complete and is one of the longest running computations in history.

It has taken more than 18 years, and hundreds of computers to crunch numbers through the night, but yesterday Jonathan Schaefer declared his job done: he had written the world's first program that was unbeatable at the game of draughts. Chinook, as the program is known, can calculate a winning response to any move made by its opponent. The worst result it can ever have is a draw, according to Dr Schaefer, an expert in artificial intelligence, working at the University of Alberta in Edmonton, Canada. The game of draughts, played on a board with eight by eight squares, is the most complicated game ever solved thanks to artificial intelligence. The number of possible positions in a game makes it one million times more complex than Connect Four.

In the next few days, humanity's ego is likely to take another hit when the world champion of the ancient Chinese game Go is beaten by a computer. Currently Lee Sedol – the Roger Federer of Go – has lost two matches to Google's AlphaGo program in their best-of-five series. If AlphaGo wins just one more of the remaining three matches, humanity will again be vanquished. Back in 1979, the newly crowned world champion of backgammon, Luigi Villa, lost to the BKG 9.8 program seven games to one in a challenge match in Monte Carlo. In 1994, the Chinook program was declared "Man-Machine World Champion" at checkers in a match against the legendary world champion Marion Tinsley after six drawn games. Sadly, Tinsley had to withdraw due to pancreatic cancer and died the following year.

Tinsley admirably overcomes this obstruction, how Tinsley's sacrifice enables his ultimate defeat, and how vided more than a glimpse of the Tinsley deals with the end of his domination University of Alberta set out to intense process it described. One Jump Ahead was written by the On a sad note, the community He succeeded. Even though One Jump Ahead is human nature. Schaeffer had to unfortunate because the world checkers the human aspects of Schaeffer's journey Finally, Kidder's book, The Soul of a New nearly unbeatable world champion of Schaeffer had to deal with However, One Jump Ahead is We also get to know many of his about and what the consequences of quite different and, in my opinion, friends and rivals, including Asa Long, this success were. We and turns has lessons to be learned was written by an outsider-- one who see these checkers players not just as about human nature.