La lente algorítmica de Turing: de la computabilidad a la teoría de la complejidad

• Autores: Josep Díaz Cort, Carme Torras Genís
• Localización: Arbor: Ciencia, pensamiento y cultura, ISSN 0210-1963, Nº 764, 2013
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • The decidability question, i.e., whether any mathematical statement could be computationally proven true or false, was raised by Hilbert and remained open until Turing answered it in the negative. Then, most efforts in theoretical computer science turned to complexity theory and the need to classify decidable problems according to their difficulty. Among others, the classes P (problems solvable in polynomial time) and NP (problems solvable in non-deterministic polynomial time) were defined, and one of the most challenging scientific quests of our days arose:

    whether P = NP. This still open question has implications not only in computer science, mathematics and physics, but also in biology, sociology and economics, and it can be seen as a direct consequence of Turing�s way of looking through the algorithmic lens at different disciplines to discover how pervasive computation is.