4 ms·
> As long as you have Turing Complete machines you made theoretical hack possible. This is false theoretically.
by witty_username 10y ago
> As long as you have Turing Complete machines you made theoretical hack possible.
This is false theoretically.
- sebastianconcpt 10y agoWhy? Can you elaborate on demonstrating that is false?
- alasdair_ 10y agoIt's possible to write a program that is provably correct, so simply because a turing machine exists, doesn't mean that the Turing machine itself makes something hackable.
- witty_username 10y agoHacks occur to due bugs in software. Theoretically, one could write bug-free software. Practically, this is very hard for any non-trivial software. For example, a while loop code in a Turing Machine is unhackable; the state repeats forever.