|
|
|
|
|
by davidgrenier
1540 days ago
|
|
Also, Turing Completeness is almost always accidental while non-TC is obtained by design. Hence, just about anything has Turing Completness which doesn't make it a feature. Now if you want to gain the ability to make serious proofs about your programs, one can make the argument you need non-TC. |
|