How does a hacker determine if a machine is unhackable? Is there some sort of method that eliminates the possibility of the machine being hackable or is not possible due to the many number of ways to hack a machine. This sounds kinda like the P=NP problem and since I was reading about this I thought it was an interesting question. Any answers are appreciated, thanks
[link] [comments]
from hacking: security in practice https://ift.tt/1e3oTtk
Comments
Post a Comment