I had thought that Meta-complexity would also cover more Logic oriented attacks on whether the Complexity problems were provable. Examples might include Fagin's theorem and issues about the provability of say P/NP within ZFC Set Theory and perhaps Godel's Incompleteness Theorem - but apparently not.
I had thought that Meta-complexity would also cover more Logic oriented attacks on whether the Complexity problems were provable. Examples might include Fagin's theorem and issues about the provability of say P/NP within ZFC Set Theory and perhaps Godel's Incompleteness Theorem - but apparently not.