logoalt Hacker News

measurablefunc • today at 4:23 AM • 1 reply • view on HN

Very cool that they can demonstrate it but it also follows from Rice's theorem. Any sufficiently expressive computational formalism has non-trivial runtime properties/effects & these can not be detected w/ static analysis so you have to run the program to see what happens.


Replies

ag8 • today at 7:09 AM

It is unfortunately also possible to construct unprobeable backdoors... [0]

[0]: https://openreview.net/forum?id=Wb8vS1kAHG