Actually I'm pretty sure many theoretical computer scientists find this useful too; it covers at a high level recent approaches for proving P != NP, such as Rya

Actually I'm pretty sure many theoretical computer scientists find this useful too; it covers at a high level recent approaches for proving P != NP, such as Ryan Williams' approach, the GCT approach, etc. Scott himself said that he had to do a lot of legwork to understand GCT. I can bet that this is the case for most theoreticians. Complexity theory is a vast field; it's difficult to become acquainted with the disparate portions of the field. Surveys such as this are valuable for the field.