Turing machines test foundations of maths

• Autores: Jacob Aron
• Localización: New scientist, ISSN 0262-4079, Nº. 3073, 2016, pág. 9
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • One hundred and fifty years of mathematics will be proved wrong if a new computer program stops running. Thankfully, it's unlikely to happen, but the code behind it is testing the limits of the mathematical realm. The program is a simulated Turing machine, a mathematical model of computation created by codebreaker Alan Turing. In 1936, he showed that the actions of any computer algorithm can be mimicked by a simple machine that reads and writes 0s and 1s on an infinitely long tape by working through a set of states, or instructions. The more complex the algorithm, the more states the machine requires. Now Adam Yedidia and Scott Aaronson of the Massachusetts Institute of Technology have created three simulated luring machines with behavior that is entwined in deep questions of mathematics