Is any classifier not subject (or less susceptible) to fooling?
I would say this is not necessarily a duplicate but quite similar to some other questions. However, I will answer the question posed here. 

At a theoretical level, what you are asking is there any algorithm that cannot be tricked into predicting the wrong class?

The answer is: No

It is analogous to asking whether there is a perfect architecture for an arbitrary classification problem, and that answer is quite obviously not. It would also not likely to be terribly difficult to show this is provably the case, at least for a class of algorithms(i.e connectionist models).