Hacker News new | ask | show | jobs
by phmx 58 days ago
Looks similar to the halting problem to me (https://en.wikipedia.org/wiki/Halting_problem)
1 comments

Whether an arbitrary piece of code can be exploited is obviously undecidable (i.e. it is equivalent to the halting problem). Let me give you an example that will sketch why this is the case: `if(sha(input1)==12345) { run_shell(input2);}`. The real question is how does this look like in practice, for the code that we as humans actually use in our networks.