Re: [isabelle] Formalizing Turing machine

OK, maybe it's a bad choice to start with formalizing Turing machine,
which is a definition not a theorem. How about formalizing Cook's
theorem, the Probabilistically Checkable Proof (PCP) theorem and the
natural proof theorem? Yes, I'm very interested in formalizing
theorems in computational complexity theory. Has anyone done this?

Zirui Wang

This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.