|
|
#8
06-28-2011, 04:14
|
|||
|
|||
|
you asked about proving it.
said in short term, you have asked if you can make a turing machine that can say if a generic turing machine can stop. A good way to understand this problem's category is to understand this: http://en.wikipedia.org/wiki/Cantor%27s_diagonal_argument Hence, that guy told you to learn the basis of (academical, tbh) IT. It's the basis of the modern logic, since it is founded over Goedel's theorems+ the Church-Turing one. Last edited by Maximus; 06-28-2011 at 04:28. 
|
|
|
Threaded Mode