Exploració per tema "computability"
Ara es mostren els items 1-1 de 1
-
Turing's algorithmic lens: from computability to complexity theory
(2013)
Article
Accés obertThe 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 ...