3 ms·
It's not that the interesting Turing machines are chaotic, but they are close to the boundary, in the sense that they have interesting dynamical behaviour. The
by GolDDranks 5y ago
It's not that the interesting Turing machines are chaotic, but they are close to the boundary, in the sense that they have interesting dynamical behaviour. The reason why it's so hard to do static analysis of computer programs (for example, an automated detection of memory vulnerabilities in C programs) is pretty much this near-chaotic dynamic behaviour that doesn't easily yield to static analysis.