Tag Archives: complexity

Godel’s Lost Letter

One can obviously easily construct a Turing machine, which for every formula F in first order predicate logic and every natural number n , allows one to decide if there is a proof of F of length n (length = … Continue reading

Posted in software engineering | Tagged , | Leave a comment