4 ms·
Turing completeness means undecidability of termination, not something you'd enjoy in DMA operations!
by nine_k 7y ago
Turing completeness means undecidability of termination, not something you'd enjoy in DMA operations!
- gizmo686 7y agoTuring completeness does not mean you cannot reason about the termination (or performance) of any particular program.
- comex 7y agoIt's not something you'd enjoy in most computer programs, but we still use Turing complete CPUs and Turing complete programming languages, because they're more flexible. No reason DMA needs to be different.
- colonwqbang 7y agoMost hardware will hang if you program it incorrectly, even if it isn't advertised as being turing-complete.
- rstuart4133 7y agoTuring completeness is a statement about the nature of infinity. It is always decidable if a Turing machine with a fixed upper bound on it's tape length will halt. There was a post (this year?) mapping Godel's incompleteness theorem to the halting problem. I found it inspiring, not in the least because the link revealed they were both in fact statements about the properties of infinity - something that was not obvious by just looking at either problem on its own. It is of those few cases where the whole was obviously bigger than the sum of the parts, for me at least.