Interesting interview. I find it very intriguing to hear how folks like Michael think and rank the impact of their essays and work. I also found it very engaging to follow along with your efforts to get some traction in this interview. Michael is so humble about is major accomplishments, but you did get into some interesting open-ended territories midway through and near the end. Michael’s read on AlphaGo was fascinating. I couldn’t but wonder how a human would perform on an Go board with astronomical high number sided spaces. But I guess that is besides the point. Nice to hear a good defense of the academy too. Increasingly difficult to pull off these days, but I think it is important that we still try. I can’t imagine an industry provided the space for the kind of inquiry I did during my dissertation. 😁
Thanks for the note—I was indeed hoping to get a little further into understanding his ways of thinking, but sometimes these things are just fundamentally mysterious!
Syntax and semantics of PL are regarded as two distinct notions. Semantics of a 3CNF formula can be described syntactically. That is, the semantics of a clause can be embedded in the syntax as a prime truth assignment. Then, incompatibility of each prime truth assignment can be checked efficiently. This approach might be a starting point to attack P vs NP (see a one-page paper https://www.academia.edu/127624992/On_Syntax_and_Semantics_of_Propositional_Logic)
Interesting interview. I find it very intriguing to hear how folks like Michael think and rank the impact of their essays and work. I also found it very engaging to follow along with your efforts to get some traction in this interview. Michael is so humble about is major accomplishments, but you did get into some interesting open-ended territories midway through and near the end. Michael’s read on AlphaGo was fascinating. I couldn’t but wonder how a human would perform on an Go board with astronomical high number sided spaces. But I guess that is besides the point. Nice to hear a good defense of the academy too. Increasingly difficult to pull off these days, but I think it is important that we still try. I can’t imagine an industry provided the space for the kind of inquiry I did during my dissertation. 😁
Thanks for the note—I was indeed hoping to get a little further into understanding his ways of thinking, but sometimes these things are just fundamentally mysterious!
Syntax and semantics of PL are regarded as two distinct notions. Semantics of a 3CNF formula can be described syntactically. That is, the semantics of a clause can be embedded in the syntax as a prime truth assignment. Then, incompatibility of each prime truth assignment can be checked efficiently. This approach might be a starting point to attack P vs NP (see a one-page paper https://www.academia.edu/127624992/On_Syntax_and_Semantics_of_Propositional_Logic)