Looks pretty good to me. Snappy, and definitely accurate. Of course, I already bought the game, so I'm not really in the target audience any more.
The old one reads way too much like the abstract of a comp-sci grad student's paper. I doubt that "The polynomial running time of this algorithm on a non-deterministic, multi-tape turing machine is O(log(n^2))" is going to really move copies, so this is a solid step in the right direction.