• Turing's algorithmic lens: from computability to complexity theory 

      Díaz Cort, Josep; Torras, Carme (2013)
      Article
      Accés obert
      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 ...