5. is it more asic resistant that qrk?
ASIC implementation of X11 would be a bit simpler and a bit less effective (in terms of performance gain over GPU per mm^2 of die space) than implementation of Quark algorithm.
X11 is rather straightforward, there are some caveats inside hash functions, but for well known hashes it would be just concatenation of published implementations.
For Quark algorithm one can implement 9 hashing stages, 3 of them will be paired - e.g. calculate Keccak and JH in parallel, then discard one of results. Or, to save die space, it's possible to implement 6 hashing cores and some dispatching and routing logic around them.
Anyway, the best ASIC protection is small capitalization of altcoins

7. is it x12, x13, x99 going to be better? will we need to fork all of the coins over and over again?
Blindly chaining hash functions could theoretically lead to increased collision rate.
This person has a great understanding of these things, his skills in this area are unquestioned. So i personally would listed to what he is saying on this particular part.
If he tells me x11 asic implementation is easier that QRK i will take that as the case. Until greater arguement is heard.
So it would seem x11 is less asic resistant that perhaps scryptN and qrk.... the question is were the 11 algos in x11 blindly chained and could they theoretically lead to increased collisions?