 Jonathan Rowson has speculated that " in principle it should be possible for a machine to ... develop 32 @-@ piece tablebases . This may take decades or even centuries , but unless runaway global warming or nuclear war gets in the way , I think it will eventually happen . " However , information theorist Claude Shannon argued that it is not feasible for any computer to actually do this . In his 1950 paper " Programming a Computer for Playing Chess " he writes : 
 Jonathan Rowson <a href='been_done' title='1'><mark>has</mark></a> speculated that " in principle it should be possible for a machine to ... develop 32 @-@ piece tablebases . This may take decades or even centuries , but unless runaway global warming or nuclear war <a href='uninflect' title='2'><mark>gets</mark></a> in the way , I think it will eventually happen . " However , information theorist Claude Shannon argued that it <a href='negative_concord' title='3'><mark>is</mark></a> <a href='negative_concord' title='4'><mark>not</mark></a>feasible for any computer to actually do this . In his 1950 paper " Programming a Computer for Playing Chess " he <a href='uninflect' title='5'><mark>writes</mark></a> : 
Jonathan Rowson done speculated that " in principle it should be possible for a machine to ... develop 32 @-@ piece tablebases . dis may take decades or even centuries , but unless runaway global warming or nuclear war get in the way , I think it gon eventually happen . " However , information theorist Claude Shannon argued that it ain't feasible fa any computer to actually do this . In his 1950 paper " Programming a Computer ffaPlaying Chess " he write :