[Question] Has Pascal’s Mugging problem been completely solved yet?

Are Kolmogorov’s difficulty and Hanson’s leverage penalty combined into one? Has the more important general problem of probabilities not converging been solved? (The lesswrong posts I looked at did not mention if there is a better solution than the “patch” of the time. Reading of concept also don’t give more understanding)