Summary: the problem with Pascal's Mugging arguments is that, intuitively, some probabilities are just too small to care about. There might be a principled reason for ignoring some probabilities, namely that they violate an implicit assumption behind expected utility theory. This suggests a possible approach for formally defining a "probability small enough to ignore", though there's still a bit of arbitrariness in it.
How could he show you "the computer simulation of 3^^^3 people"? What could you do to verify that 3^^^3 people were really being simulated?
You probably couldn't verify it. There's always the possibility that any evidence you see is made up. For all you know you are just in a computer simulation and the entire thing is virtual.
I'm just saying he can show you evidence which increases the probability. Show you the racks of servers, show you the computer system, explain the physics that allows it, lets you do the experiments that shows those physics are correct. You could solve any NP complete problem on the computer. And you could run programs that take known numbers of steps to compute. Like actually calculating 3^^^3, etc.