3 ms·
Sure, but it is possible to be Turing-complete. There may be further things a Turing machine can never do, but we want to do at least that much. If the type sys
by nighthawk454 4y ago
Sure, but it is possible to be Turing-complete. There may be further things a Turing machine can never do, but we want to do at least that much. If the type system is not “fully powerful” in this way it may be lacking in some useful aspect.
- cakoose 4y agoYeah, but the phrasing seems likely to mislead. It sort of implies that a Turing-complete type system can express all truths.